On the signed $2$-independence number of graphs

S.M. Hosseini Moghaddam, D.A. Mojdeh, Babak Samadi, Lutz Volkmann


In this paper, we study the signed 2-independence number in graphs and give new sharp upper and lower bounds on the signed 2-independence number of a graph by a simple uniform approach. In this way, we can improve and generalize some known results in this area.


domination number, limited packing, tuple domination, signed 2-independence number

Full Text:


DOI: http://dx.doi.org/10.5614/ejgta.2017.5.1.4


  • There are currently no refbacks.

ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats