Characterisation of self-complementary chordal graphs
β Scribed by M.R. Sridharan; K. Balaji
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 208 KB
- Volume
- 188
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
and only if its clique number is integral part of (p + 1)/2.
π SIMILAR VOLUMES
## Abstract The class of selfβcomplementary symmetric graphs is characterized using the classification of finite simple group.
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.
In 1992, H. Zhang (J. Graph Theory 16, 1-5), using the classification of finite simple groups, gave an algebraic characterisation of self-complementary symmetric graphs. Yet, from this characterisation it does not follow whether such graphs, other than the well-known Paley graphs, exist. In this pap