GATE 2025 Discrete Mathematics Foundation Quiz 30

Which of the following statement is correct?
S₁ : In simple connected undirected graph no two vertices are of same degree.
S₂ : In 3 regular graph with n vertices, the maximum vertex connectivity of a graph is 3

A graph with n vertices and n-1 edges that is not a tree, is?

Consider the graph below:

What is the chromatic number of G?

Assumed undirected graph G is connected. G has 6-vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected?

An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are?