Existence of independent [1, 2]-sets in caterpillars
Given a graph G, a subset S ⊆ V (G) is an independent [1, 2]-set if no two vertices in S are adjacent and for every vertex ν ∈ V (G)\S, 1 ≤ |N(ν) ∩ S| ≤ 2, that is, every vertex ν ∈ V (G)\S is adjacent to at least one but not more than two vertices in S. In this paper, we discuss the existence of in...
Saved in:
Main Authors: | , |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2016
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/mathematics-faculty-pubs/45 https://aip.scitation.org/doi/abs/10.1063/1.4940820 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!