| 自补图的连通度研究 |
| |
| 引用本文： | 蓝开允. 自补图的连通度研究[J]. 四川大学学报(自然科学版), 1990, 27(3): 293-296 |
| |
| 作者姓名： | 蓝开允 |
| |
| 作者单位： | 四川大学物理系 |
| |
| 摘 要： | 研究了非平凡自补图,给出了自补图的最大度与最小度的关系,提出了自补图连通度的公式.上述两项结论,以4阶图和5阶图为例,进行了分析讨论.
|
| 关 键 词： | 自补图 连通度 点连通度 边连通度 |
A STUDY OF CONNECTIVITY OF SELF-COMPLEMENTAL GRAPHS |
| |
| Lan Kaiyun. A STUDY OF CONNECTIVITY OF SELF-COMPLEMENTAL GRAPHS[J]. Journal of Sichuan University (Natural Science Edition), 1990, 27(3): 293-296 |
| |
| Authors: | Lan Kaiyun |
| |
| Affiliation: | Department of Physics |
| |
| Abstract: | Non trivial self-complemental graphs are systematically studied in this paper, and the relation between the maximum and minimum degrees, and a formula for finding the connectivity of a self-complemental graph are given. The results are illustrated and tested with 4-order and 5- order graphs. |
| |
| Keywords: | self-complernental graph connectivity vertex connectivity edge connectivity. |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
