An alternative enumeration of self-complementary graphs

被引：0
|
作者：
Nakamoto, Atsuhiro [1 ]
Shirakura, Teruhiro [2 ]
Tazawa, Shinsei [3 ]
机构：
[1] Yokohama Natl Univ, Dept Math, Fac Educ & Human Sci, Yokohama, Kanagawa 2408502, Japan
[2] Kobe Univ, Dept Math & Informat, Fac Human Dev, Kobe, Hyogo 6578501, Japan
[3] Kinki Univ, Dept Math, Fac Sci & Engn, Higashiosaka, Osaka 5778502, Japan
来源：
UTILITAS MATHEMATICA | 2009年 / 80卷
关键词：
Self-complementary graph; Burnside's Lemma; automorphism group;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let e(n), o(n), sc(n) be the number of unlabelled graphs of order n with an even number of edges, the number of those with an odd number of edges, and the number of unlabelled self-complementary graphs of order, n, respectively. In 2001, Gordon F. Royle conjectured the equality sc(n) = e(n) - o(n). This paper shows that this conjecture is true.
引用
收藏
页码：25 / 32
页数：8
相关论文
共 50 条
12345