✦ LIBER ✦

On strongly regular self - complementary graphs

✍ Scribed by Sergio Ruiz

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 133 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050213

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

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.

The Spectra of Complementary Subgraphs i

The Spectra of Complementary Subgraphs in a Strongly Regular Graph

✍ D. de Caen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 117 KB

New families of strongly regular graphs

✍ Yury J. Ionin; Hadi Kharaghani 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208–217, 2003; Published online in Wiley InterScience (www.interscience.wil

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.

Deza graphs: A generalization of strongl

Deza graphs: A generalization of strongly regular graph

✍ M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

On Strongly Regular Graphs withμ =&

On Strongly Regular Graphs withμ =  1

✍ J. Deutsch; P.H. Fisher 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in ter