Unit V Quiz Questions
Unit V Quiz Questions
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
a) Null graph
b) Singleton graph
c) Complete graph
d) Trivial graph
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.
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
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
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.
a) Always 1
b) Always 2
c) At most 2
d) At most 3