Semitotal Domination in Claw-Free Cubic Graphs | |
Zhu, Enqiang ; Shao, Zehui ; Xu, Jin | |
刊名 | GRAPHS AND COMBINATORICS
![]() |
2017 | |
关键词 | Cubic graph Semitotal domination Claw-free |
DOI | 10.1007/s00373-017-1826-z |
英文摘要 | The semitotal domination number of a graph G without isolated vertices is the minimum cardinality of a set S of vertices of G such that every vertex in is adjacent to at least one vertex in S, and every vertex in S is within distance 2 of another vertex of S. In Henning and Marcon (Ann Comb 20(4):1-15, 2016), it was shown that every connected claw-free cubic graph G of order n has semitotal domination number at most when , and it was conjectured that the bound can be improved from to if . In this paper, we prove this conjecture.; National Natural Science Foundation of China [61672051, 61309015]; Fundamental Research Funds for the Central Universities of China [DUT16RC(3)065]; SCI(E); ARTICLE; 5; 1119-1130; 33 |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/484854] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Zhu, Enqiang,Shao, Zehui,Xu, Jin. Semitotal Domination in Claw-Free Cubic Graphs[J]. GRAPHS AND COMBINATORICS,2017. |
APA | Zhu, Enqiang,Shao, Zehui,&Xu, Jin.(2017).Semitotal Domination in Claw-Free Cubic Graphs.GRAPHS AND COMBINATORICS. |
MLA | Zhu, Enqiang,et al."Semitotal Domination in Claw-Free Cubic Graphs".GRAPHS AND COMBINATORICS (2017). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论