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.
a. Partite
b. Bipartite
c. Rooted
d. Bisects
Answer: (b).Bipartite

12. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
a. vertices, edges
b. edges, vertices
c. vertices, paths
d. graph node, edges
Answer: (a).vertices, edges

13. A ……….. is a graph that has weights of costs associated with its edges.
a. Network
b. Weighted graph
c. Both A and B
d. None of the above
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.
a. Directed tree
b. Undirected tree
c. Dis-joint tree
d. Direction oriented tree
Answer: (a).Directed tree

15. 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
Answer: (d).all of above

16. A connected graph T without any cycles is called
a. a tree graph
b. free tree
c. a tree
d. All of above
Answer: (d).All of above

17. 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
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
a. isolated
b. complete
c. finite
d. strongly connected
Answer: (b).complete

19. Other name for directed graph is ..........
a. Direct graph
b. Bigraph
c. Dir-graph
d. Digraph
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.
a. Leterally connected
b. Widely Connected
c. Unliterally connected
d. Literally connected
Answer: (c).Unliterally connected

Page 2 of 17