4.9k views
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________

edited | 4.9k views

Consider the example of complete graph, In a complete graph which is $(n-1)$ regular (where n is the no of vertices) has edges $\frac{n(n-1)}{2}$
$n$ vertices are adjacent to $n-1$ vertices and an edge contributes two degree so dividing by $2$.

$d*n = 2*|E|$
Therefore, in $d$ regular graph No of edges will be $\frac{n*d}{2}$

by Boss (42.8k points)
edited by

In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.

In the given que, no. of vertices= n

deg of each vertices= d (no. of neighbor of each vertices)

total edges= n*(no. of neighbor)/2= (n*d)/2

by Loyal (7.1k points)

1
2