×

On self-complementation. (English) Zbl 0587.05054

From the authors’ abstract: “We prove that, with very few exceptions, every graph of order \(n\), \(n\equiv 0, 1\pmod 4\) and size at most \(n-1\), is contained in a self-complementary graph of order \(n\). We study a similar problem for digraphs.”
Reviewer: R. C. Read

MSC:

05C75 Structural characterization of families of graphs
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Burns, J. Graph Theory 1 pp 277– (1977)
[2] Burns, Israel J. Math. 30 pp 313– (1978)
[3] Clapham, Discrete Math. 8 pp 251– (1974)
[4] Faudree, Czecho. Math. J. 31 pp 53– (1981)
[5] Rao, Discrete Math. 7 pp 225– (1977)
[6] Read, J. London Math. Soc. 38 pp 99– (1963)
[7] Ringel, Arch. Math. 14 pp 354– (1963)
[8] Sachs, Publ. Math. Debrecen 9 pp 270– (1962)
[9] Schuster, Int. J. Math. Math. Sci. 1 pp 335– (1978)
[10] Grafy i digrafy samodope Iniajace. Report (1977).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.