A regular self-complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
β¦ LIBER β¦
On separable self-complementary graphs
β Scribed by Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Katsuhiro Ota; Shinsei Tazawa; Mamoru Watanabe
- Book ID
- 108315772
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 65 KB
- Volume
- 257
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On regular self-complementary graphs
β
Nora Hartsfield
π
Article
π
1987
π
John Wiley and Sons
π
English
β 74 KB
Self-complementary graphs
β
Richard A Gibbs
π
Article
π
1974
π
Elsevier Science
π
English
β 762 KB
Self-complementary graphs
β
D. A. Suprunenko
π
Article
π
1986
π
Springer US
π
English
β 728 KB
On strongly regular self - complementary
β
Sergio Ruiz
π
Article
π
1981
π
John Wiley and Sons
π
English
β 133 KB
π 1 views
## Abstract It is shown that certain conditions assumed on a regular selfβcomplementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
More on almost self-complementary graphs
β
Nevena FrancetiΔ; Mateja Ε ajna
π
Article
π
2009
π
Elsevier Science
π
English
β 611 KB
Self-complementary symmetric graphs
β
Hong Zhang
π
Article
π
1992
π
John Wiley and Sons
π
English
β 236 KB
## Abstract The class of selfβcomplementary symmetric graphs is characterized using the classification of finite simple group.