On the signed $2$-independence number of graphs
<p>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.</p>
Main Authors: | S.M. Hosseini Moghaddam, D.A. Mojdeh, Babak Samadi, Lutz Volkmann |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/125 |
Similar Items
Signed Total Roman Edge Domination In Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-11-01)
by: Asgharsharghi Leila, et al.
Published: (2017-11-01)
Similar Items
-
New Bounds on the Signed Total Domination Number of Graphs
by: Moghaddam Seyyed Mehdi Hosseini, et al.
Published: (2016-05-01) -
On the Signed (Total) K-Independence Number in Graphs
by: Khodkar Abdollah, et al.
Published: (2015-11-01) -
On the inverse signed total domination number in graphs
by: D. A. Mojdeh, et al.
Published: (2017-01-01) -
Graphs with equal domination and independent domination numbers
by: Purnima Gupta, et al.
Published: (2020-10-01) -
Domination Number, Independent Domination Number and 2-Independence Number in Trees
by: Dehgardi Nasrin, et al.
Published: (2021-02-01)