On the existence problem of the total domination vertex critical graphs

被引:5
|
作者
Sohn, Moo Young [3 ]
Kim, Dongseok [2 ]
Kwon, Young Soo [1 ]
Lee, Jaeun [1 ]
机构
[1] Yeungnam Univ, Dept Math, Kyongsan 712749, South Korea
[2] Kyonggi Univ, Dept Math, Suwon 443760, South Korea
[3] Changwon Natl Univ, Dept Math, Chang Won 641773, South Korea
关键词
Total domination numbers; Total domination vertex critical graphs; Maximal degree; DIAMETER;
D O I
10.1016/j.dam.2010.09.004
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The existence problem of the total domination vertex critical graphs has been studied in a series of articles we first settle the existence problem with respect to the parities of the total domination number m and the maximum degree Delta for even m except m = 4 there is no m-gamma(iota) critical graph regardless of the parity of Delta for m = 4 or odd m >= 3 and for even Delta an m-gamma(iota)-critical graph exists if and only if Delta >= 2left perpendicular m-1/2 right perpendicular for m = 4 or odd m >= 3 and for odd Delta if Delta >= 2left perpendicular m-1/2 right perpendicular + 7 then m-gamma(iota)-critical graphs exist if Delta < 2left perpendicular m-1/2 right perpendicular then m-gamma(iota)-critical graphs do not exist The only remaining open cases are Delta = 2left perpendicular m-1/2 right perpendicular + k k = 1 3 5 Second we study these remaining open cases when m = 4 or odd m >= 9 As the previously known result for m = 3 we also show that for Delta(G) = 3 5 7 there is no 4-gamma(iota)-critical graph of order Delta (G) + 4 On the contrary it is shown that for odd m >= 9 there exists an m-gamma(iota)-critical graph for all Delta >= m - 1 (C) 2010 Elsevier B V All rights reserved
引用
收藏
页码:46 / 52
页数:7
相关论文
共 50 条