self-complementary graph

self-complementary graph

[¦self ‚käm·plə‚men·trē ′graf]
(mathematics)
A simple graph that is isomorphic to its complement.
References in periodicals archive ?
A permutation [sigma] of [1, n] is a self-complementing permutation of a self-complementary graph of order n if and only if all the orbits of [sigma] have their cardinalities congruent to 0 (mod 4) except, possibly, one orbit of cardinality 1.
The 2-uniform self-complementary hypergraphs are exactly self-complementary graphs.