Publication | Closed Access
Every (<i>p</i>, <i>p</i>‐2) graph is contained in its complement
55
Citations
0
References
1977
Year
Network ScienceGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph TheorySize P ‐2Extremal Graph TheoryIsomorphic EmbeddingOrder P
Abstract The following is proved: If G is graph of order p (≥2) and size p ‐2, then there exists an isomorphic embedding of G into its complement.