| 8个顶点的所有10个自补图 |
| |
| 引用本文： | 许进 李正兴. 8个顶点的所有10个自补图[J]. 宁夏大学学报(自然科学版), 1990, 11(1): 5-9 |
| |
| 作者姓名： | 许进 李正兴 |
| |
| 作者单位： | 陕西师范大学(许进)，宁夏大学数学系(李正兴) |
| |
| 摘 要： | 本文应用度序列的方法及自补置换圈的有关结果,构造出了8个顶点的全部10个自补图。
|
| 关 键 词： | 自补图 度序列 自补置换图 顶点 |
Ten Self-Complementary Graphs on Eight Vertices |
| |
| Xu Jin Li Zhengxing. Ten Self-Complementary Graphs on Eight Vertices[J]. Journal of Ningxia University(Natural Science Edition), 1990, 11(1): 5-9 |
| |
| Authors: | Xu Jin Li Zhengxing |
| |
| Affiliation: | Xu Jin Li Zhengxing (Shanxi Normal University) (Department of Mathematics) |
| |
| Abstract: | The enumeration problem on self-complementary graphs(for short S. C. graphs)was solved by Read in 1963 [3]. There are 1, 2, 10, 36 S. C. graphs on 4, 5, 8, 9 vertices, respectively. All S. C. graphs 4 and 5 vertices are well known. After seaching extonsiuely in eiterature, the anthors believe that the anstraction of all 10 S. C. graghs is still an open problem, In this paper, on 8 vertices are given by using the method of potentially self-com plementary degree seguences and complementing permutation cycles. |
| |
| Keywords: | Self-Complementary graphs Degree sequence Self-Complementing permutation cycle Potentially Self-Complementary degree sequence. |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
