A Constructive Characterization of Trees with the Same Distance-3 Domination Number

摘要：

　　For a graph G,the distance between two vertices u and v in G equals the minimum length of a u-v path.A vertex-subset D is a distance-3 dominating set if every vertex not belonging to D is at distance at most three of a vertex in D.The distance-3 domination number()3 g G of a graph G is the minimum cardinality of a distance-3 dominating set in G.Here we consider the trees.Let G(n)be the set of trees T satisfying(T)=n 3 g,where n 3 1.In this paper,we provide a constructive characterization of G(n)for all n 3 1.

关键词： Tree Distance-3 dominating set Distance-3 domination number

作者: Min-Jen JOU Jenq-Jong LIN Qian-Yu LIN

作者单位: Ling Tung University,Taichung 40852,Taiwan ,2Ling Tung University,Taichung 40852,Taiwan National Chiayi University,Chiayi 60004,Taiwan

会议类型: 国际会议

会议名称: INTERNATIONAL CONFERENCE ON COMPUTATIONAL MODELING, SIMULATION AND OPTMIZATION (CMSO 2019)(2019年计算建模、仿真与优化国际会议)

会议地点: 北京

会议语种:英文

页码: 283-286

在线出版日期: 2019-11-24（万方平台首次上网日期，不代表论文的发表时间）