Cybernetics

, Volume 21, Issue 5, pp 559–567 | Cite as

Self-complementary graphs

  • D. A. Suprunenko
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York (1973).Google Scholar
  2. 2.
    M. J. Colbourn and C. J. Colbourn, “Graph isomorphisms and self-complementary graphs,” SIGACT News,10, No. 1, 25–29 (1978).Google Scholar
  3. 3.
    M. Kropar and R. C. Read, “On the construction of the self-complementary graphs on 12 nodes,” J. Graph Theory,3, No. 2, 111–125 (1979).Google Scholar
  4. 4.
    I. A. Faradzhev, “The determination of the complete list of self-complementary graphs with up to 12 vertices,” in: Algorithmic Investigations in Combinatorics [in Russian], Nauka, Moscow (1977), pp. 69–75.Google Scholar
  5. 5.
    G. Ringel, “Selbstkomplementäre Graphen,” Arch. Math., No. 14, 354–358 (1963).Google Scholar
  6. 6.
    H. Sachs, “Über selbstkomplementäre Graphen,” Publ. Math. Debrecen, No. 9, 270–288 (1962).Google Scholar
  7. 7.
    D. A. Suprunenko, Matrix Groups, Am. Math. Soc., Providence, Rhode Island (1976).Google Scholar

Copyright information

© Plenum Publishing Corporation 1986

Authors and Affiliations

  • D. A. Suprunenko

There are no affiliations available

Personalised recommendations