The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
214 views

Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?

 

in Graph Theory by Junior (853 points)
edited by | 214 views
0

Dhillu Thambi yes i know that

v = 6, k = 2

now make a a complete graph of 5 edges will have 10 edges 

another component is isolated vertex

so you see graph is not connected. 

and plug both values in your formula you'll get 10 as answer 

0
if G is a disconnected graph then ans would be 19.
0
I have edited the question.
0
@Utkarsh With Connected graph it's not possible as it has only one component.But if it's simple graph then also it's not possible I'm unable to get this point.

Please explain anyone.
0

Soumya Tiwari with simple disconnected graph its possible

0

@Utkarsh Joshi 

n1-1 + n2-1 + n3-1 + n4-1 + n5-1 + n6-1 + n7-1= 26.

n1+n2+n3+n4+n5+n6+n7=19.

it is 26+7 = 33, right?

0
oops :) yes!
0
i am getting 27 ??

if it is wrong please someone update answer

correction after @shaik masthan comment : correct answer is 33
+1
0
thanks @shailk masthan

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2
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
50,362 questions
55,786 answers
192,411 comments
90,919 users