The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+11 votes
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
asked in Graph Theory by Veteran (59.9k points)
edited by | 4.7k views

2 Answers

+16 votes
Best answer

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}$

answered by Boss (42.7k points)
edited by
+2 votes

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

answered by Loyal (7.9k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
48,691 questions
52,776 answers
68,389 users