Computer Sciences > GATE 2015 SET-2 > Graph Theory
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, n is
Correct : d
Similar Questions
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
Total Unique Visitors
Loading......