An isolated vertex has degree______ zero two one none of these Let. G be a conne

Question

An isolated vertex has degree______ zero two one none of these Let. G be a connected planar, simple graph with 7 edges and 7 vertices. Let. r be the number, of regions in a planar representation of G. Then r = _____ 1 2 49 14 A connected multi graph has an Euler path but no, an Euler circuit if and only if it has exactly _____ vertices of odd degree. four three two one If G is a simple graph with n vertices with n 3 such that deg(u) + deg (nu) n for every pair of nonadjacent vertices u and nu in G, then G has a _____ Euler circuit Euler path Hamilton circuit Hamilton path The adjacency matrix is square matrix diagonal matrix square and symmetric matrix asymmetric matrix A graph with even degrees of vertices has Euler path Euler circuit Hamilton path Hamilton circuit Fill in the blanks: An edge connect to itself is called ______. A pseudo graph is a graph that has ______ A vertex with degree one is called _____ vertex. Let G be a undirected graph. G is called connected if _____.

Explanation / Answer

Q1)

A) a) zero

b) n - e + f = 2. Thus, there are 2 regions in the graph.

c) 2

d) Hamiltonian circuit.

e)Square as well a symmetric.

f)Euler Circuit.

B)

g)Self Loop

h)self loops and parallel edges.

i)Pendant

j) There exists a path between wevery pair of vertices in G

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.