| 11. | A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2. |
|
Answer: (b).Bipartite
|
| 12. | A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. |
|
Answer: (a).vertices, edges
|
| 13. | A ……….. is a graph that has weights of costs associated with its edges. |
|
Answer: (c).Both A and B
|
| 14. | A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. |
|
Answer: (a).Directed tree
|
| 15. | In a graph if e=[u, v], Then u and v are called |
|
Answer: (d).all of above
|
| 16. | A connected graph T without any cycles is called |
|
Answer: (d).All of above
|
| 17. | In a graph if e=(u, v) means |
|
Answer: (d).both b and c
|
| 18. | If every node u in G is adjacent to every other node v in G, A graph is said to be |
|
Answer: (b).complete
|
| 19. | Other name for directed graph is .......... |
|
Answer: (d).Digraph
|
| 20. | 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. |
|
Answer: (c).Unliterally connected
|
