If G is self complementary on n vertices then 4|n(n-1)
by adityaguharoy, Sep 11, 2017, 1:33 PM
A graph 
is called self complementary if and only if it is isomorphic to it's own complement.
Prove that if a graph with 
vertices, is self complementary if and only if 
is a multiple of 
.
is called self complementary if and only if it is isomorphic to it's own complement.Prove that if a graph
with 
vertices, is self complementary if and only if 
is a multiple of 
.
vertices. And thus, 
is proved.
it is obvious.
and 
see the attached drawing.
be a graph with 
of length 
and 
to every vertex of 
.
path addition.)
must be self complementary.
look like ?
with 
with 
vertices that is also self complementary.
vertices.
of length 
and 
are also self complementary etc..)Attachments:
This post has been edited 2 times. Last edited by adityaguharoy, Sep 11, 2017, 1:35 PM
April 2021
February 2021