| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777637 | Journal of Combinatorial Theory, Series B | 2017 | 25 Pages |
Abstract
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, a complete classification is given of edge-transitive almost self-complementary graphs. This is then used to answer some open questions reported in the literature.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jin-Xin Zhou,