| 图的控制临界数 |
| |
| 引用本文： | 张建州.图的控制临界数[J].电子科技大学学报(社会科学版),1993(3). |
| |
| 作者姓名： | 张建州 |
| |
| 作者单位： | 电子科技大学应用数学系 成都 |
| |
| 摘 要： | 引入了图的控制临界数的概念:图的控制临界数等于使它的控制数减小而需添加的最少边数。给出了一般图的控制临界数的最好上界;并确定了路、圏和完全多部图的控制临界数的精确值。
|
| 关 键 词： | 图 控制数 控制临界图 控制临界数 |
NUMBERS OF CRITICAL DOMINATION FOR A GRAPH |
| |
| Zhang Jianzhou.NUMBERS OF CRITICAL DOMINATION FOR A GRAPH[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1993(3). |
| |
| Authors: | Zhang Jianzhou |
| |
| Abstract: | The number of critical domination for a graph is defined. The number of critical domination for a graph equals minimum cardinality of edge set to add to the graph such that its domination number reduces. The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph. |
| |
| Keywords: | graphs domination number domination critical graphs numbers of critical domination |
| 本文献已被 CNKI 等数据库收录！ |
