A graph is said to be complete if there is no edge between every pair of vertices.

Related MCQs

• A graph is said to be complete if there is an edge between every pair of vertices.
• If every node u in G is adjacent to every other node v in G, A graph is said to be
• let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are
• In a graph if e=(u, v) means
• In a graph if e=[u, v], Then u and v are called
• A connected graph T without any cycles is called
• In selection sort of n elements,how many times is the swp function called in the complete execution of the algorithm?
• In selection sort of n elements,how many times is the swap function called in the complete execution of the algorithm?
• The depth of a complete binary tree is given by
• Because of linear structure of linked list having linear ordering,there is similarity between linked list and array in