On the signed 2-independence number of graphs

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.

Saved in:
Bibliographic Details
Published inElectronic journal of graph theory and applications Vol. 5; no. 1; pp. 36 - 42
Main Author Moghaddam, S.M. Hosseini
Format Journal Article
LanguageEnglish
Published Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 01.04.2017
Subjects
domination number, limited packing, tuple domination, signed 2-independence number
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2338-2287
2338-2287
DOI:10.5614/ejgta.2017.5.1.4