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: | , , , |
---|---|
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 |
id |
doaj-b9fb6456f0064c69831886a08a02bbec |
---|---|
record_format |
Article |
spelling |
doaj-b9fb6456f0064c69831886a08a02bbec2021-03-11T01:13:05ZengIndonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), IndonesiaElectronic Journal of Graph Theory and Applications2338-22872017-04-0151364210.5614/ejgta.2017.5.1.472On the signed $2$-independence number of graphsS.M. Hosseini Moghaddam0D.A. Mojdeh1Babak Samadi2Lutz Volkmann3Qom Azad University, Qom, IranDepartment of Mathematics, University of Mazandaran, Babolsar, IranDepartment of Mathematics, University of Mazandaran, Babolsar, IranLehrstuhl II f\"{u}r Mathematik, RWTH Aachen University, 52056 Aachen, Germany<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>https://www.ejgta.org/index.php/ejgta/article/view/125domination number, limited packing, tuple domination, signed 2-independence number |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
S.M. Hosseini Moghaddam D.A. Mojdeh Babak Samadi Lutz Volkmann |
spellingShingle |
S.M. Hosseini Moghaddam D.A. Mojdeh Babak Samadi Lutz Volkmann On the signed $2$-independence number of graphs Electronic Journal of Graph Theory and Applications domination number, limited packing, tuple domination, signed 2-independence number |
author_facet |
S.M. Hosseini Moghaddam D.A. Mojdeh Babak Samadi Lutz Volkmann |
author_sort |
S.M. Hosseini Moghaddam |
title |
On the signed $2$-independence number of graphs |
title_short |
On the signed $2$-independence number of graphs |
title_full |
On the signed $2$-independence number of graphs |
title_fullStr |
On the signed $2$-independence number of graphs |
title_full_unstemmed |
On the signed $2$-independence number of graphs |
title_sort |
on the signed $2$-independence number of graphs |
publisher |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia |
series |
Electronic Journal of Graph Theory and Applications |
issn |
2338-2287 |
publishDate |
2017-04-01 |
description |
<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> |
topic |
domination number, limited packing, tuple domination, signed 2-independence number |
url |
https://www.ejgta.org/index.php/ejgta/article/view/125 |
work_keys_str_mv |
AT smhosseinimoghaddam onthesigned2independencenumberofgraphs AT damojdeh onthesigned2independencenumberofgraphs AT babaksamadi onthesigned2independencenumberofgraphs AT lutzvolkmann onthesigned2independencenumberofgraphs |
_version_ |
1714790785578172416 |