摘要
本文应用度序列的方法及自补置换圈的有关结果,构造出了8个顶点的全部10个自补图。
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.
出处
《宁夏大学学报（自然科学版）》
CAS
1990年第1期5-9,共5页
Journal of Ningxia University(Natural Science Edition)
关键词
自补图
度序列
自补置换图
顶点
Self-Complementary graphs, Degree sequence, Self-Complementing permutation cycle, Potentially Self-Complementary degree sequence.
