List of top Computer Science & Information Technology Questions on Graph Theory asked in AP PGECET

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, \( n \) is _______.
Dijkstra's algorithm fails for graphs with _______.
Assume G is a simple undirected graph and some vertices of G are of odd degree. Add a node \( v \) to G and make it adjacent to each odd degree vertex of G, then the resultant graph is sure to be _______.
A subgraph H of a graph G is called a clique if _______.
For a given graph G having \( v \) vertices and \( e \) edges which is connected and has no cycles, which of the following statements is true?

The union and intersection of the graphs G and H are respectively

Match the following:

 

The cut vertex set of the graph is

A graph has $ n $ vertices and $ e $ edges. What is the number of vertices in the spanning tree of that graph?
What is the chromatic number of a bipartite graph?
How many edges will a tree with $ n $ vertices have?

What is the minimum number of colours required to colour the following graph?

Which of the following statements is not true?

What are the in-degree and out-degree of vertex 4?

Which of the following statements is true?