共 50 条
A note on the domination dot-critical graphs
被引:3
|作者:
Chen, Xue-gang
[1
]
Shiu, Wai Chee
[2
]
机构:
[1] N China Elect Power Univ, Dept Math, Beijing 102206, Peoples R China
[2] Hong Kong Baptist Univ, Dept Math, Kowloon Tong, Hong Kong, Peoples R China
关键词:
Domination dot-critical;
Domination number;
Complete bipartite graph;
D O I:
10.1016/j.dam.2009.07.014
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G' = aleph is 2-connected? In this note, we give a family of 1-connected 2k-dot-critical graph with G' = aleph and show that this problem has a negative answer. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:3743 / 3745
页数:3
相关论文