| 图的控制数及全控制数的估计 |
| |
| 引用本文： | 亓健,谭尚旺. 图的控制数及全控制数的估计[J]. 中国石油大学学报(自然科学版), 1997, 0(6) |
| |
| 作者姓名： | 亓健 谭尚旺 |
| |
| 作者单位： | 石油大学应用数学系 |
| |
| 摘 要： | 研究了图的控制数及全控制数，对满足一定条件的图给出了图的控制数及全控制数的估计。
|
| 关 键 词： | 连通图；控制数；全控制数 |
ESTIMATIONS FOR THE DOMINATION NUMBER AND TOTAL DOMINATION NUMBER OF A GRAPH |
| |
| Qi Jian,Dept. of Math and physics in the University of petroleum,China. Tan Shangwang. ESTIMATIONS FOR THE DOMINATION NUMBER AND TOTAL DOMINATION NUMBER OF A GRAPH[J]. Journal of China University of Petroleum (Edition of Natural Sciences), 1997, 0(6) |
| |
| Authors: | Qi Jian Dept. of Math physics in the University of petroleum China. Tan Shangwang |
| |
| Abstract: | 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. |
| |
| Keywords: | Connected graph Domination number Total domination number |
| 本文献已被 CNKI 等数据库收录！ |
