- 期刊
- OpenAccess
On Graphs with No Proper Perfect Dominating Set
並列摘要
A set of vertices in a graph is perfect dominating if every vertex outside the set is adjacent to exactly one vertex in the set, and is neighborhood connected if the subgraph induced by its open neighborhood is connected. In any graph the full set of vertices is perfect dominating, and in every connected graph the full set of vertices is neighborhood connected. It is shown that(i) in a connected graph, if the only neighborhood connected perfect dominating set is the full set of vertices, then the full set of vertices is also the only perfect dominating set; and (ii) if r ≥ 3 and n1, ... ,nr ≥ 2, then in Kn1,...,nr the only perfect dominating set is the full set of vertices. Also, (iii) estimates are derived of how many edges can be removed from or added to Kn1,...,nr while preserving the property described in (ii).
並列關鍵字
無資料被引用紀錄
延伸閱讀
- Kırlangıc, A., & Turan, G. B. (2012). ON THE RUPTURE DEGREE OF A GRAPH. Neural Network World, 22(1), 39-51. https://doi.org/10.14311/NNW.2012.22.003
- 蔡秀英（2015）。A Study of 4-Critical Graphs〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2015.00958
- 吳柏翰 (2013). A Study on the Optimal Pebbling of Graphs [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2511201311341525
- 林律淳（2020）。A Study of the domination number of graphs〔碩士論文，淡江大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0002-0608202010550300
- Harinarayanan, C. V. R., Ponnappan, C. Y., Subbiah, S. P., Sundareswaran, R., & Swaminathan, V. (2007). Just Excellence and Very Excellence in Graphs with Respect to Strong Domination. Tamkang Journal of Mathematics, 38(2), 167-175. https://www.airitilibrary.com/Article/Detail?DocID=00492930-200706-38-2-167-175-a