phs engtih of a walk tour. path, or cycle is the aumber of edges on that walk, t
ID: 3585572 • Letter: P
Question
phs engtih of a walk tour. path, or cycle is the aumber of edges on that walk, tour, path, or cycle IE a wertex in a undirected. simple. graph with at least ten vertices is on a cycle, the degree of that vertex cannot be less than A) 3 (B) 0 (C) 4 (E) 2 (F) 9 (G) 1 D) none of the other answers are correct what is the length of the longest possible path in a simple graph? (A) the umber of edges plus 1 (B) the umber of edges (C) the mumber of edges minus 1 (D) the number of vertices minus 1 (E) the number of vertices phus 1 (F) the number of vertices 39. Consider these statements: (a) esery simple, connected graph has a Hamiltonian path (b) every simple, complete graph has a Hamiltonian path Which are true? (A) both (B) only the first (C) neither (D) only the second 40. In a simple, directed graph, the most number of edges in a graph with V vertices is: (A) none of the other answers are correct B) (va-v/2 (c) va-1 (D) (va-/2 (E) 2V (F) (Va-V) (G) V2/2 (H) VExplanation / Answer
37 : answer is F
n-1
=9
38:what is the length of the longest possible path in a simple graph
ans : option D
vertices-1
39:
B) only the first
The connected planar graph has a hamiltonian cycle.
40:
Option F
maximum number of edges is V(v-1)
=v^2-v
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.