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:
書目詳細資料
主要作者: Chien, Hans Steven Co
格式: 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
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: De La Salle University
語言: English