The Gateway to Computer Science Excellence
0 votes
98 views
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
in Graph Theory by Loyal (7k points)
edited by | 98 views
0
45 ?
0
:O Why 45 brother?
0
Because every vertex degree is 2 means there is a single big cycle containing every vertex so minimum cut edge should contain 0 edges because if i remove any edge graph won't be disconnected shouldn't it ?
0

@Na462

as every vertes has degeree 2 so its a cycle. now in cycle removal of any two edge will disconnect the graph and we have total 10 edges so we can select any 2 out of 10 in 10C2 ways. so 45

0
BDW whats the answer ?
0
0 is the answer brother
0
o extremely sorry i have seen cut edge as cut set
0
Every vertex with degree 2 means cycle graph so no cut vertex and no cut edge

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
50,737 questions
57,405 answers
198,627 comments
105,467 users