in Mathematical Logic
727 views
1 vote
1 vote
The minimum number of edges the graph G should have for the graph G to a 3-connected  and it given that G has 10 vertices ?
in Mathematical Logic
by
727 views

4 Comments

ok, thank u :)

actually I got -ve vote that is why asking
0
0
your first comment, formula is absolutely wrong, so may someone gave down vote
0
0
Actually ans will be 7

as min no. of edges they want

3 components , vertices will be divide like 4,3,3
0
0

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