GATE CSE
First time here? Checkout the FAQ!
x
0 votes
47 views

every vertex has a minimum degree, therefore, least number of edges that will be in the graph is given by the handshaking lemma as = min×|v|/2=2 E is right?

 

 

asked in Graph Theory by Active (2k points)   | 47 views

$\delta \leqslant \frac{2e}{v}\leq \Delta$.

Here $\delta$ is minimum degree and $\Delta$ is maximum degree.

1 Answer

0 votes

Minimum degree of an vertex is 0 so there is possibility of 0 edges.

If you are asking minimum number of edge in an connected graph then.

Least number of edges such that graph can be connected is simply n-1

Least number of edges to ensure that graph must be connected is $\frac{(n-1)(n-2)}{2}$+1 or n-1C2+1

Given equation in question seems to be ambiguous because there is no proper definition of min  what is min referred as?

answered by Loyal (3.1k points)  

Related questions

0 votes
1 answer
1
asked in Computer Networks by LavTheRawkstar Boss (5.7k points)   | 89 views
0 votes
0 answers
2
asked in Mathematical Logic by iita Active (1.9k points)   | 33 views
0 votes
1 answer
3


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Hemant Parihar

    1502 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1416 Points

  5. Niraj Singh 2

    1391 Points

  6. Debashish Deka

    1246 Points

  7. Rupendra Choudhary

    1194 Points

  8. rahul sharma 5

    1158 Points

  9. Arjun

    956 Points

  10. srestha

    950 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1960 Points

  2. Niraj Singh 2

    1386 Points

  3. junaid ahmad

    502 Points

  4. Debashish Deka

    414 Points

  5. sudsho

    410 Points


23,373 questions
30,079 answers
67,405 comments
28,396 users