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 602 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments 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.