Enumeration of Bipartite Self-Complementary Graphs

被引：4
|
作者：
Ueno, Makoto [1 ]
Tazawa, Shinsei [2 ]
机构：
[1] NSC CO LTD, Toyonaka, Osaka 5610845, Japan
[2] Kinki Univ, Fac Appl Sociol, Higashiosaka, Osaka 5778502, Japan
来源：
GRAPHS AND COMBINATORICS | 2014年 / 30卷 / 02期
关键词：
Bipartite self-complementary graph; Burnside's Lemma; Automorphism group;
D O I：
10.1007/s00373-012-1275-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let e(m, n), o(m, n), bsc(m, n) be the number of unlabelled bipartite graphs with an even number of edges whose partite sets have m vertices and n vertices, the number of those with an odd number of edges, and the number of unlabelled bipartite self-complementary graphs whose partite sets have m vertices and n vertices, respectively. Then this paper shows that the equality bsc(m, n) = e(m, n) - o(m, n) holds.
引用
收藏
页码：471 / 477
页数：7
相关论文
共 50 条
12345