Define : Self-complementary graph. Give one example.
Answers
Answered by
3
A self-complementary graph is a graph which is isomorphic to its graph complement. ... By definition, a self-complementary graph must have exactly half the total possible number of edges, i.e., edges for a self-complementary graph on vertices. Since must be divisible by 4, it follows that or 1 (mod 4).
Answered by
0
I hope this help you
Attachments:
Similar questions