PG Graph Theory (PM2024)

Can we have a graph of order 3 or more with a bridge but no cut vertices?

• No

• Yes

If v is a vertex that is farthest from u in G, then v is

• not a cut vertex

• cut vertex

• end vertex

• not an end vertex

Every nontrivial connected graph contains atleast ______ vertices that are not cut vertices

• 1

• 2

• 3

• 0

A nontrivial connected graph with no cut vertices _________

• nonseparable graph

• block

• complete

• bipartite

Absence of cut vertices in a connected graph implies the presence of a bridge in G.

• False

• True

In which graph every two vertices lie on a common cycle?

• nonseparable

• geodetic

• cubic

• Path

Block of a graph is a maximal nonseparable subgraph of a graph G

• True

• False

Two blocks have atleast one vertex in common.

• False

• True

G contains two nonadjacent vertices if G is ________

• not complete

• not a block

• nonseparable

• bipartite

A connected graph contains _____ if and only if G is ______ .

• a vertex cut, not complete

• not a vertex cut, complete

• a vertex cut, complete

• not a vertex cut, not complete