Independent [1,2]-sets in some classes of cactus graphs
A [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbours in it. If the additional requirement that the set be independent is added, the existence of such a set is not guaranteed in every graph. In this paper, we study the existence of...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2020
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/5984 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/13088/viewcontent/Co_Chien_Hans_Steven_11698306_Partial.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | A [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbours in it. If the additional requirement that the set be independent is added, the existence of such a set is not guaranteed in every graph. In this paper, we study the existence of independent [1, 2]-sets in some classes of cactus graphs and determine such sets for some parameters of the graph. In particular, we will show that there exists an independent [1, 2]-set for any cactus graph with k ≥ 2 cycles, 2 and 3 as the minimum and maximum degree of a vertex in the cactus graph, respectively. We also study the minimum cardinality of an independent [1, 2]-set in some other classes of cactus graphs. |
|---|