Graphs Questions

MCQ bookmark_border

21.

In a graph if e=[u, v], Then u and v are called

A

endpoints of e

B

adjacent nodes

C

neighbors

D

all of above

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

A connected graph T without any cycles is called

A

a tree graph

B

free tree

C

a tree

D

All of above

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

If every node u in G is adjacent to every other node v in G, A graph is said to be

A

isolated

B

complete

C

finite

D

strongly connected

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

Other name for directed graph is ..........

A

Direct graph

B

Bigraph

C

Dir-graph

D

Digraph

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

A

Leterally connected

B

Widely Connected

C

Unliterally connected

D

Literally connected

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

A connected graph T without any cycles is called ........

A

free graph

B

no cycle graph

C

non cycle graph

D

circular graph

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

In a graph if E=(u,v) means ......

A

u is adjacent to v but v is not adjacent to u

B

e begins at u and ends at v

C

u is processor and v is successor

D

both b and c

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

A

I only

B

II only

C

both I and II

D

neither I and II

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

A

The number of paths of length K from vertex Vi to vertex Vj.

B

Shortest path of K edges from vertex Vi to vertex Vj.

C

Length of a Eulerian path from vertex Vi to vertex Vj.

D

Length of a Hamiltonian cycle from vertex Vi to vertex Vj.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

A

2n

B

(2n-1)/2

C

2e

D

4n

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion