Awesome q2a theme
0 votes
9 views

How many edges must a graph with N vertices have in order to guarantee that it is connected? 

here on stack overflow they said (n-1)*(n-2)/2 +1

https://cs.stackexchange.com/questions/7373/how-many-edges-must-a-graph-with-n-vertices-have-in-order-to-guarantee-that-it-i

but i have doubt in it suppose we consider graph on 10 vertices.

here we need just 21 edges for n=10

but according to given formula it is 9*8/2  + 1 = 37.

so what is correct?

in Graph Theory by (13 points) | 9 views
0
With 21 edges and 10 vertices, can't we have a disconnected graph?
If yes, it mean we can't guarantee graph is connected with 10 vertices and 21 edges.
0
How can we have disconnected graph (simple graph)

can you show , how can i add 21st edge in above graph such that after addition graph will be still disconnected and simple?
0
In that 10 vertices group... Make it complete graph..

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jan 2020
  1. shashin

    1163 Points

  2. Vimal Patel

    306 Points

  3. Deepakk Poonia (Dee)

    305 Points

  4. Debapaul

    237 Points

  5. Satbir

    192 Points

  6. SuvasishDutta

    137 Points

  7. Pratyush Priyam Kuan

    118 Points

  8. tp21

    108 Points

  9. DukeThunders

    96 Points

  10. pranay562

    95 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,989 questions
1,509 answers
8,936 comments
89,814 users