GRAPHS SELF-COMPLEMENTARY IN KN-E

被引：10
|
作者：
CLAPHAM, CRJ
机构：
[1] Department of Mathematics, University of Aberdeen, Aberdeen
来源：
DISCRETE MATHEMATICS | 1990年 / 81卷 / 03期
关键词：
D O I：
10.1016/0012-365X(90)90062-M
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Graphs self-complementary in Kn-e exist for those values of n where self-complementary graphs do not exist. For these graphs, the structure of the complementing permutation is analysed and their diameter is determined. The definition is related to the notions of "self-complement index" and "self-complementary index" defined by other authors. © 1990.
引用
收藏
页码：229 / 235
页数：7
相关论文
共 50 条
12345