On the signed 2-independence number of graphs

DOI10.5614/ejgta.2017.5.1.4zbMath1467.05189OpenAlexW2605864031MaRDI QIDQ5006598

Seyyed Mehdi Hosseini Moghaddam, Lutz Volkmann, Babak Samadi, Doost Ali Mojdeh

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.1.4

zbMATH Keywords

domination numbersigned 2-independence numberlimited packingtuple domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Unique response strong Roman dominating functions of graphs ⋮ Degree equitable restrained double domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The modified negative decision number in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Lower bounds on several versions of signed domination number
• Limited packings in graphs
• Signed 2-independence in graphs
• Bounds on the signed 2-independence number in graphs
• On domination and annihilation in graphs with claw-free blocks

This page was built for publication: On the signed 2-independence number of graphs