Article ID Journal Published Year Pages File Type
9513557 Discrete Mathematics 2005 19 Pages PDF
Abstract
We prove that, with one exception, each (n,n)-graph G that is embeddable in its complement has a self-complementary supergraph of order n.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On self-complementary supergraphs of (n,n)-graphs
Authors
, , ,