Graph Theory MCQ Test: Graph Theory MCQs - Practice Questions
1. What does a Hamiltonian cycle in a graph refer to?
2. What is the term used for a graph that has a path from every vertex to every other vertex but not necessarily a closed path?
3. What is the term used for a graph in which the edges have a direction?
4. In graph theory, what does a 'cut edge' refer to?
5. In a directed graph, what are edges typically called?
6. In a graph, what does the term 'cut vertex' refer to?
7. In graph theory, what does 'path' refer to?
8. Which of the following statements about Eulerian graphs is true?
9. What is the term used for a graph that contains no cycles?
10. Which of the following properties does a graph possess if it can be drawn in such a way that no edges intersect each other?
11. Which theorem states that the sum of the degrees of all vertices in a graph is twice the number of edges?
12. Which graph theory problem involves coloring the vertices of a graph such that no two adjacent vertices share the same color?
13. Which graph theory problem deals with finding a sequence of vertices such that each consecutive pair forms an edge?
14. What is the term used for a path that visits every vertex exactly once?
15. What is the maximum number of edges in an acyclic graph with 'n' vertices?
16. What is the term used for a graph that has exactly one vertex of odd degree?
17. Which theorem states that in any graph, the sum of the degrees of all vertices is twice the number of edges?
18. In graph theory, what does 'forest' refer to?
19. What does the term 'adjacent' mean in the context of graph theory?
20. What is the edge chromatic number of a complete graph with 'n' vertices?