0 votes 0 votes 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 ? Graph Theory graph-theory ace-test-series + – Na462 asked Jan 19, 2019 • edited Mar 3, 2019 by I_am_winner Na462 624 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Manas Mishra commented Jan 19, 2019 reply Follow Share 45 ? 0 votes 0 votes Na462 commented Jan 19, 2019 reply Follow Share :O Why 45 brother? 0 votes 0 votes Na462 commented Jan 19, 2019 i edited by Na462 Jan 19, 2019 reply Follow Share 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 votes 0 votes Manas Mishra commented Jan 19, 2019 reply Follow Share @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 votes 0 votes Manas Mishra commented Jan 19, 2019 reply Follow Share BDW whats the answer ? 0 votes 0 votes Na462 commented Jan 19, 2019 reply Follow Share 0 is the answer brother 0 votes 0 votes Manas Mishra commented Jan 19, 2019 reply Follow Share o extremely sorry i have seen cut edge as cut set 0 votes 0 votes Mk Utkarsh commented Jan 19, 2019 reply Follow Share Every vertex with degree 2 means cycle graph so no cut vertex and no cut edge 0 votes 0 votes Please log in or register to add a comment.