WorksheetsGraph Theory Quiz
Total questions: 20
Worksheet time: 20mins
In an undirected graph the number of vertices with odd degree must be
Zero
Odd
Prime
Even
A graph is a collection of
Row and columns
Vertices and edges
Equations
None of these
Which of the following describes a loop?
This edge connects point A to point C
This edge connects points A and B
This edge connects point C to point C
This edge connects point B to point D
In any undirected graph the sum of degrees of all the nodes
Must be even
is twice the number of edges
Must be odd
Need not be even
A graph with one vertex and no edges is
Multigraph
Digraph
Isolated graph
Trivial graph
The maximum degree of any vertex in a simple graph with n vertices is
n-1
n+1
2n-1
n
A simple graph in which there is an edge between every pair of vertices is called
Planar graph
pseudo graph
Complete graph
Regular graph
A simple graph in which all vertices are of same degree then it is called
Planar graph
pseudo graph
Complete graph
Regular graph
How many edges are there in a graph with 10 vertices each of degree 3?
17
15
10
3
How many edges does a graph have if it has vertices of degree 5, 2, 2, 2, 2, 1?
7
5
14
12
Let G be the graph with 10 vertices. If four vertices has degree four and six vertices has degree five, then find the number of edges of G.
16
30
46
23
An undirected graph G has 16 edges and all the vertices are of degree 2. Find the number of vertices
16
32
64
12
How many edges are there in a graph with 10 vertices each of degree 6?
60
30
10
6
A graph contains 21 edges, 3 vertices of degree 4 and all other vertices of degree 2. Find total number of vertices.
21
36
18
12
For any simple graph G, the maximum number of edges of G is
n(n+1)2
(n+1)2
(n-1)2
n(n-1)2
A graph is Euerian if
Every vertex is of odd degree
Every vertex is even degree
Vertices may have both odd and even degree
Exactly two vertices are of odd degree
A path in a graph that traverses every edge exactly once is called
Hamilton path
Simple path
Euler Path
Walk
A graph G has an Euler path if
Every vertex is of odd degree
Every vertex is even degree
Vertices may have both odd and even degree
Exactly two vertices are of odd degree
A path in a graph that traverses every vertex exactly once is called
Hamilton path
Simple path
Euler Path
Trail
A circuit in a graph that traverses every edge exactly once is called
Hamilton path
Simple path
Euler circuit
Hamilton circuit
