wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

If for some positive integer k, degree of vertex d(v) = k for every vertex v of the graph G, then G is called -

A
K graph
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
K - regular graph
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
Empty graph
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
All of these
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is C K - regular graph

If for some positive integer k, degree of vertex d (v) = k for every vertex v of the graph G, then G is called K-regular graph.

Graph theoryis the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices, nodes, or points which are connected by edges, arcs, or lines.

A regular graph is a graph where each vertex has the same number of neighbors; that is every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other.

The degree of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. In the graph on the right, the maximum degree is 5 and the minimum degree is 0.


flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Definition of Function
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon