✦ LIBER ✦

r-partite self-complementary graphs—diameters

✍ Scribed by T. Gangopadhyay; S.P. Rao Hebbare

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 473 KB
Volume: 32
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90262-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths in r-partite self-complementary gr

Paths in r-partite self-complementary graphs

✍ T. Gangopadhyay; S.P. Rao Hebbare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 683 KB

It is shown that. every connected bi-p.s.c, graphs G(2I of order p. with a bi-partite complementing permutation (bi-p.e.p) o" having mixed cycles, has a (p-3)-path and this result is best possible. Further. if the graph induced on each cycle of bi-p.c.p, of G( 2) is connected then G(2) has a hamilto

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

Total chromatic number of complete r-par

Total chromatic number of complete r-partite graphs

✍ K. H. Chew; H. P. Yap 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par

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