Scribd
Upload
21 views4 pages

Unit V Quiz Questions

Uploaded by

21eg305105
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views4 pages

Unit V Quiz Questions

Uploaded by

21eg305105
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1. Which of the following is a fundamental concept in graph theory?

a) Nodes b) Vectors c) Matrices d) Scalars

2. What is a spanning tree in a graph?

a) A tree that spans all the nodes of the graph


b) A tree with the maximum number of nodes
c) A tree with the minimum number of edges
d) A tree that includes all the edges of the graph

3. Which of the following is true about planar graphs?

a) They cannot have cycles.


b) They can be embedded in a plane without edges crossing.
c) They must have a Hamiltonian cycle.
d) They cannot have vertices with odd degrees.

4. Euler's formula relates the number of vertices (V), edges (E), and faces (F) of a
connected planar graph as:

a) V-E+F=0
b) V+E=F+2
c) V+E-F=2
d) V-E=F+2

5. Which of the following is NOT a property of trees?

a) They are connected.


b) They have no cycles.
c) They contain a Hamiltonian path.
d) They have n−1 edges, where n is the number of vertices.

6. In graph theory, a subgraph is a graph that:

a) Contains only a subset of the vertices of the original graph.


b) Contains only a subset of the edges of the original graph.
c) Contains both a subset of vertices and a subset of edges from the original graph.
d) Contains all the vertices but only a subset of the edges from the original graph.

7. A directed tree is a tree in which:

a) All edges have the same direction.


b) All edges have different directions.
c) There is a unique path between every pair of vertices.
d) There are no cycles.

8. The chromatic number of a graph represents:

a) The number of vertices in the graph.


b) The maximum degree of a vertex in the graph.
c) The minimum number of colors needed to color the vertices so that no two
adjacent vertices have the same color.
d) The number of edges in the graph.

9. A graph with exactly one vertex and no edges is called a:

a) Null graph
b) Singleton graph
c) Complete graph
d) Trivial graph

10. A Hamiltonian graph is a graph that:

a) Has a Hamiltonian cycle.


b) Has a Hamiltonian path.
c) Is connected.
d) Has no cycles.

11. The Four-Color Problem is concerned with:

a) Finding the minimum number of colors needed to color the vertices of a graph.
b) Determining if a graph is planar.
c) Finding the maximum degree of a vertex in a graph.
d) Coloring the regions of a map in such a way that no two adjacent regions have the
same color.

12. Which of the following statements is true about binary trees?

a) Each node can have any number of children.


b) Each node can have at most two children.
c) Each node must have exactly two children.
d) Binary trees cannot have cycles.

13. A graph that has multiple edges between the same pair of vertices is called a:

a) Multigraph
b) Bipartite graph
c) Planar graph
d) Eulerian graph

14. Which theorem gives a necessary and sufficient condition for a graph to be planar?

a) Euler's theorem
b) Kuratowski's theorem
c) Ramsey's theorem
d) Hall's theorem

15. Which of the following is a property of a connected graph?

a) It contains at least one cycle.


b) There exists a path between every pair of vertices.
c) It has a chromatic number of 1.
d) It has more edges than vertices.
16. What is the degree of a vertex in a graph?

a) The number of edges adjacent to the vertex.


b) The number of vertices adjacent to the vertex.
c) The sum of the degrees of all vertices in the graph.
d) The distance between the vertex and the farthest vertex in the graph.

17. A graph that can be drawn without any edges crossing is called:

a) Connected
b) Bipartite
c) Planar
d) Eulerian

18. In a complete graph with n vertices, how many edges are there?

a) n
b) n−1
c) n(n−1)/2
d) 2n

19. Which of the following is a property of a Hamiltonian cycle in a graph?

a) It visits every vertex exactly once and ends at the starting vertex.
b) It visits every edge exactly once and ends at the starting vertex.
c) It visits every vertex exactly twice.
d) It visits every vertex exactly once.

20. The chromatic number of a tree is:

a) Always 1
b) Always 2
c) At most 2
d) At most 3

Fill in the Blanks:

1. A graph without any cycles is called a _______________.


2. In a directed tree, each node has exactly one _______________.
3. A subgraph of a graph G that includes all the vertices of G and is a tree is called a
_______________.
4. Euler's formula for planar graphs is V - E + F = _______________.
5. A graph is _______________ if it can be drawn on a plane without any edges
crossing.
6. A graph with exactly one vertex and no edges is called a _______________.
7. A Hamiltonian graph is a graph that contains a _______________.
8. A graph that has multiple edges between the same pair of vertices is called a
_______________.
9. Kuratowski's theorem provides a necessary and sufficient condition for a graph to be
_______________.
10. In a complete graph with n vertices, there are n(n−1)/2 _______________.
1. a) Nodes
2. c) A tree with the minimum number of edges
3. b) They can be embedded in a plane without edges crossing.
4. c) V + E - F = 2
5. c) They contain a Hamiltonian path.
6. c) Contains both a subset of vertices and a subset of edges from the original graph.
7. d) There are no cycles.
8. c) The minimum number of colors needed to color the vertices so that no two adjacent
vertices have the same color.
9. a) Null graph
10. a) Has a Hamiltonian cycle.
11. d) Coloring the regions of a map in such a way that no two adjacent regions have the
same color.
12. b) Each node can have at most two children.
13. a) Multigraph
14. b) Kuratowski's theorem
15. b) There exists a path between every pair of vertices.
16. a) The number of edges adjacent to the vertex.
17. c) Planar
18. c) n(n−1)/2
19. a) It visits every vertex exactly once and ends at the starting vertex.
20. c) At most 2

1) A graph without any cycles is called a forest.


2) In a directed tree, each node has exactly one parent.
3) A subgraph of a graph GGG that includes all the vertices of GGG and is a tree is
called a spanning tree.
4) Euler's formula for planar graphs is V−E+F=2
5) A graph is planar if it can be drawn on a plane without any edges crossing.
6) A graph with exactly one vertex and no edges is called a singleton graph.
7) A Hamiltonian graph is a graph that contains a Hamiltonian cycle.
8) A graph that has multiple edges between the same pair of vertices is called a
multigraph.
9) Kuratowski's theorem provides a necessary and sufficient condition for a graph to be
non-planar.
10) In a complete graph with n vertices, there are n(n−1)/2 edges.

You might also like