1.

A graph G has the degree of each vertex is ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤ 2|E| and 3|R| ≤ 2|E|, then the graph is said to be ________ (R denotes region in the graph)

A. Planner graph
B. Polyhedral graph
C. Homomorphic graph
D. Isomorphic graph
Answer» C. Homomorphic graph


Discussion

No Comment Found