摘要
研究了图的控制数及全控制数,对满足一定条件的图给出了图的控制数及全控制数的估计。
A set D of vertices in graph G is a domination (total domination) set, if every vertex in V D (v) is dominated by one vertex in D at least. The domination (total domination) number of G is the minimum number of vertices in a dominating (total dominating) set of G . An estimation for the dominating number of a graph was studied by O.ore, an estimation for the total dominating number of a graph was studied by Cockagne. This paper gives another estimation for the domination number and total domination number of a graph.
出处
《石油大学学报(自然科学版)》
EI
CSCD
1997年第6期106-107,共2页
Journal of the University of Petroleum,China(Edition of Natural Science)
基金
石油大学校科研基金
关键词
连通图
控制数
全控制图
图
估计
Connected graph
Domination number
Total domination number