Graph theory

A graph is a collection of.... ?

• Row and columns

• Vertices and edges

• Equations

• None of these

The degree of any vertex of graph is .... ?

• The number of edges incident with vertex

• Number of vertex in a graph

• Number of vertices adjacent to that vertex

• Number of edges in a graph

A graph with no edges is known as empty graph. Empty graph is also known as... ?

• Trivial Graph

• Bipartite graph

• Regular graph

• None of these

If the origin and terminus of a walk are same, the walk is known as... ?

• Open

• Closed

• Path

• None of these

A graph G is called a ..... if it is a connected a cyclic graph

• Regular graph

• Cyclic graph

• Not a graph

• Tree

A minimal spanning tree of a graph G is

• A spanning sub graph

• A tree

• Minimum weights

• All the above

The expression a+a c is equivalent to

• a

• a+c

• C

• 1

The maximum degree of any vertex in a simple graph with n vertices is

• n

• n-1

• n+1

• 2n

A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

• greater than n–1

• less than n(n–1)

• greater than n(n–1)/2

• less than n2/2

How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?

• 2n(n+1)/2 and 2n.3n(n–1)/2

• 3n(n–1)/2 and 2n(n–1)

• 2n(n+1)/2 and 3n(n–1)/2

• 2n(n+1)/2 and 2n(n–1)/2