2 votes 2 votes Cyclometric complexity of a flow graph G with n vertices and e edges is V(G) = e+n-2 V(G) = e-n+2 V(G) = e+n+2 V(G) = e-n-2 Graph Theory ugcnetcse-june2013-paper2 graph-theory + – go_editor asked Jul 13, 2016 recategorized Jul 14, 2016 by LeenSharma go_editor 740 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Let G be a connected planar graph, and let n, e and V(G) denote, respectively, the numbers of vertices, edges, and cyclometric complexity of graph G. Then V(G)= e - n + 2. Hence,Option(2)V(G)= e - n + 2. LeenSharma answered Jul 13, 2016 selected Jul 13, 2016 by asu LeenSharma comment Share Follow See 1 comment See all 1 1 comment reply Sanjay Sharma commented Jul 13, 2016 reply Follow Share in option 2 it is e-n+2 so please edit ur ans 0 votes 0 votes Please log in or register to add a comment.