On self-complementation

  title={On self-complementation},
  author={Abdelhamid Benhocine and A. Pawel Wojda},
  journal={Journal of Graph Theory},
We prove that, with very few exceptions, every graph of order n, n = 0, 1 (mod 4) and size a t most n 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs. Throughout the paper, G and D will denote a finite graph and a finite digraph, respectively, without loops or multiple edges, with vertex-sets V(G) and V ( D ) , and edge-sets E(G) and E(D); define r (G) = IE(G)I, e(D) = (E(D)I. An edge of G joining x and y is denoted by xy, an edge of D from i to… CONTINUE READING


Publications citing this paper.
Showing 1-8 of 8 extracted citations

On Packable Digraphs

SIAM J. Discrete Math. • 2010
View 3 Excerpts
Highly Influenced

A note on packing of two copies of a hypergraph

Discussiones Mathematicae Graph Theory • 2007
View 1 Excerpt

Packing of graphs and permutations--a survey

Discrete Mathematics • 2004
View 1 Excerpt

Packing of graphs and permutations

Electronic Notes in Discrete Mathematics • 2000
View 1 Excerpt


Publications referenced by this paper.
Showing 1-3 of 3 references

Embedding graphs in their complements

K. J . Faudree, C. C. Rousseau, R. H. Schelp, S. Schustcr
C:och. M a t h . J • 1981

Embedding graphs in their complements Characterization of self - complementary graphs with 2 - factors

S. Schustcr
Discwtr Mritli • 1977