recategorized by
740 views

1 Answer

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 - + 2.

 

selected by
Answer:

Related questions

3 votes
3 votes
3 answers
1
shivani2010 asked Jun 12, 2016
4,585 views
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
2 votes
2 votes
1 answer
2
go_editor asked Jul 14, 2016
2,244 views
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known ashand...
3 votes
3 votes
2 answers
3
go_editor asked Jul 14, 2016
4,029 views
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?-42-22-21-106
2 votes
2 votes
1 answer
4
Sanjay Sharma asked May 7, 2016
3,546 views
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?M+N-CM-N-CM-N+CM+N+C