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
Posted: Thu Jul 14, 2022 9:05 am
a) Planner graph
b) Polyhedral graph
c) Homomorphic graph
d) Isomorphic graph
b) Polyhedral graph
c) Homomorphic graph
d) Isomorphic graph