First time here? Checkout the FAQ!
0 votes

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 (2.5k points) 15 47 | 64 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 Boss (9.5k points) 5 29 58

Related questions

0 votes
0 answers
asked in Mathematical Logic by iita Active (2.1k points) 2 26 85 | 37 views
+2 votes
2 answers

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
Top Users Oct 2017
  1. Arjun

    23338 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7912 Points

  4. srestha

    6228 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4968 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4286 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points

Recent Badges

Popular Question makhdoom ghaya
Popular Question junaid ahmad
Notable Question learner_geek
Notable Question jothee
Popular Question jothee
Notable Question Jeffrey Jose
Notable Question air1ankit
Nice Question jothee
Verified Human shaleen25
Popular Question jothee
27,290 questions
35,142 answers
33,231 users