Domination dot-critical graphs with no critical vertices

被引：0

作者：

Zhao Chengye ^{[1
]}

Yang Yuansheng ^{[1
]}

Sun Linlin ^{[1
]}

机构：

[1] Dalian Univ Technol, Dept Comp Sci, Dalian 116024, Peoples R China

来源：

DISCRETE MATHEMATICS | 2008年 / 308卷 / 15期

关键词：

domination; dot-critical; critical vertex;

D O I：

10.1016/j.disc.2007.06.029

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. Burton and Sumner [Discrete Math. 306 (2006) 11-18] posed the problem: Is it true that for k >= 4, there exists a totally k-dot-critical graph with no critical vertices? In this paper, we show that this problem has a positive answer. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：3241 / 3248

页数：8