GATE CSE
First time here? Checkout the FAQ!
x
0 votes
43 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)   | 43 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 Active (2.5k points)  

Related questions

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


Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,040 answers
63,230 comments
24,135 users