- 期刊
- OpenAccess
LIAR'S DOMINATION IN GRAPHS UNDER SOME OPERATIONS
摘要
A set S ⊆ V (G) is a liar's dominating set (lds) of graph G if |NG[v]∩S| ≥ 2 for every v ∈V (G) and |(NG[u]∪NG[v])∩S|≥ 3 for any two distinct vertices u, v ∈ V (G). The liar's domination number of G, denoted by _(γLR)(G), is the smallest cardinality of a liar's dominating set of G. In this paper we study the concept of liar's domination in the join, corona, and lexicographic product of graphs.
關鍵字
無資料延伸閱讀
- Huang, L. H. (2009). On the Rank of Graphs [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2009.01977
- Hsu, F. R. (2006). Distance-two domination of graphs [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-0207200917335787
- Pushpam, P. R. L., & Yokesh, D. (2010). Differentials in Certain Classes of Graphs. Tamkang Journal of Mathematics, 41(2), 129-138. https://www.airitilibrary.com/Article/Detail?DocID=00492930-201006-201012230069-201012230069-129-138
- Khoeilar, R., Chellali, M., Karami, H., & Sheikholeslami, S. M. (2021). Game k-Domination Number of Graphs. Tamkang Journal of Mathematics, 52(4), 453-466. https://doi.org/10.5556/j.tkjm.52.2021.3254
- 蔡秀英（2015）。A Study of 4-Critical Graphs〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2015.00958