✦ LIBER ✦

On regular self-complementary graphs

✍ Scribed by Nora Hartsfield

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 74 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110411

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On strongly regular self - complementary

On strongly regular self - complementary graphs

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

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.

Constructing regular self-complementary

Constructing regular self-complementary uniform hypergraphs

✍ Shonda Gosselin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 1 views

In this article, we examine the possible orders of t-subset-regular selfcomplementary k-uniform hypergraphs, which form examples of large sets of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-Rezaie's necessary conditions on the order of these structures in terms of the binary rep

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

Transitive tournaments and self-compleme

Transitive tournaments and self-complementary graphs

✍ András Gyárfás 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

Rao's conjecture on self-complementary g

Rao's conjecture on self-complementary graphs with K-factors

✍ Kiyoshi Ando 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract Rao posed the following conjecture, “Let G be a self‐complementary graph of order __p__, π = (d~1~ … dp) be its degree sequence. Then G has a k‐factor if and only if π − k, = (d1 − k, … dP − k) is graphical.” We construct a family of counterexamples for this conjecture for every k ⩾ 3.