𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


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
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.

On regular self-complementary graphs
✍ Nora Hartsfield πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 74 KB

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.

All Self-Complementary Symmetric Graphs
✍ Wojciech Peisert πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 153 KB

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