Signed domination in regular graphs

被引:79
作者
Favaron, O [1 ]
机构
[1] UNIV PARIS 11,LRI,URA 410 CNRS,F-91405 ORSAY,FRANCE
关键词
D O I
10.1016/0012-365X(96)00026-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph.
引用
收藏
页码:287 / 293
页数:7
相关论文
共 4 条
[1]   INDEPENDENCE, CLIQUE SIZE AND MAXIMUM DEGREE [J].
FAJTLOWICZ, S .
COMBINATORICA, 1984, 4 (01) :35-38
[2]  
HENNING MA, IN PRESS DISCRETE MA
[3]  
HENNING MA, IN PRESS ARS COMBIN
[4]   Some remarks on domination in cubic graphs [J].
Zelinka, B .
DISCRETE MATHEMATICS, 1996, 158 (1-3) :249-255