- 期刊
- OpenAccess
Complementary Nil Domination Number of a Graph
並列摘要
A set S⊆V is said to be a complementary nil dominating set of a graph G if it is a dominating set and its complement V-S is not a dominating set for G. The minimum cardinality of a cnd-set is called the complementary nil domination number of G and is denoted by γand(G). In this paper some results on the complementary nil domination number are obtained.
被引用紀錄
Chiu, Y. C. (2014). 分散式系統之自我穩定極小控制集演算法與凱氏圖之正負號星控制數 [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2014.00642
延伸閱讀
- Li, Y. S. (2011). Domination in generalized Petersen graphs. [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-1903201314412556
- 洪明岳（2013）。The study of C4 saturated graph〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2013.00406
- Basavanagoud, B., & Hosamani, S. M. (2012). Edge Dominating Graph of a Graph. Tamkang Journal of Mathematics, 43(4), 603-608. https://www.airitilibrary.com/Article/Detail?DocID=00492930-201212-201212270034-201212270034-603-608
- Chien, Y. Y. (2004). Power Domination on Graphs [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2004.00532
- Dogan, D., & Dundar, P. (2013). The Average Covering Number of a Graph. Journal of Applied Mathematics, 2013(), 556-559-756. https://doi.org/10.1155/2013/849817