Mark the following statements as true or false.
a. A simple graph has no loops and no parallel edges.
b. Two vertices are called connected if there is an edge incident on them.
c. A graph G is strongly connected if any two vertices in G are connected.
d. If an entry in the adjacency matrix of a graph is 1, the corresponding vertices are adjacent.
e. In the adjacency list representation of a graph G, corresponding to each vertex, v, there is an array such that each vertex adjacent from v is stored in this array.
f. The breadth first traversal of a graph is similar to traversing a binary tree level by level.
g. The weight of the path is the largest weight of an edge on that path.
h. Every graph has a spanning tree.
i. A minimal spanning tree of a graph is a spanning tree with the minimum weight.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.