The bondage numbers and efficient dominations of vertex-transitive graphs
The bondage numbers and efficient dominations of vertex-transitive graphs
复制标题
顶点传递图的束缚数和有效支配
DOI:
10.1016/j.disc.2007.03.027
复制
发表时间:
2008-02
影响因子:
0.8
通讯作者:
Xu, Jun-Ming
中科院分区:
文献类型:
--
作者:
Huang, Jia;Xu, Jun-Ming
The bondage number of a graph G is the minimum number of edges whose removal results in a graph with larger domination number. A dominating set D is called an efficient dominating set of G if |N-[v]∩D|=1 for every vertex v∈V(G). In this paper we establish a tight lower bound for the bondage number of a vertex-transitive graph. We also obtain upper bounds for regular graphs by investigating the relation between the bondage number and the efficient domination. As applications, we determine the bondage number for some circulant graphs and tori by characterizing the existence of efficient dominating sets in these graphs.
登录
查看更多内容
DOI:
10.1007/978-1-4419-8698-6
发表时间:
2003-07
期刊:
--
影响因子:
--
作者:
Junming Xu
通讯作者:
Junming Xu
DOI:
10.5040/9781636700892.00000089
发表时间:
1966
期刊:
Tidskrift for Sveriges sjukskoterskor
影响因子:
--
作者:
D. H. Hwang
通讯作者:
D. H. Hwang
DOI:
--
发表时间:
1993
期刊:
--
影响因子:
--
作者:
Douglas M. Van Wieren;M. Livingston;Q. Stout
通讯作者:
Douglas M. Van Wieren;M. Livingston;Q. Stout
影响因子:
6.9
作者:
Junming Xu
通讯作者:
Junming Xu
DOI:
10.1057/jors.1977.45
发表时间:
1978-03
期刊:
--
影响因子:
--
作者:
E. Lloyd;J. Bondy;U. Murty
通讯作者:
E. Lloyd;J. Bondy;U. Murty