ACtE05 · Chapter 5Mock Test 07🏛️ Past Licensure QuestionID: b839452f
In graph theory, a graph in which every vertex has the exact same degree () is called a:
In graph theory, a graph in which every vertex has the exact same degree () is called a:
Multiple Choice Options
- A
Complete graph
- B✓ Correct Option
Regular graph (-regular graph)
- C
Multigraph
- D
Bipartite graph
Detailed Technical Solution & Explanation
A regular graph is a graph where each vertex has the same number of neighbors (degree). If every vertex has degree , it is called a -regular graph. (A complete graph is a special case where ).
Option Analysis:
•
Option A (Complete graph): Every pair of distinct vertices is connected by a unique edge (degree ).
•
Option B (Regular graph (k-regular graph)): Correct. General graph where all vertices have equal degree .
•
Option C (Multigraph): Contains multiple edges between pairs of vertices.
•
Option D (Bipartite graph): Vertices can be partitioned into two disjoint sets.
Reference: Mock Test 07NEC Licensure Syllabus