A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

Related MCQs

• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A graph is a tree if and only if graph is
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• Which data structure is used in breadth first search of a graph to hold nodes?
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• In a graph G if e=(u,v), then u and v are called ___________.
• Which of the following pair’s traversals on a binary tree can build the tree uniquely?
• For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..