In a graph if e=(u, v) means

Related MCQs

• A graph is said to be complete if there is no edge between every pair of vertices.
• A graph is said to be complete if there is an edge between every pair of vertices.
• let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are
• If every node u in G is adjacent to every other node v in G, A graph is said to be
• In a graph if e=[u, v], Then u and v are called
• A connected graph T without any cycles is called
• _______ is a structure used to represent the linear relationship between elements by means of sequential memory locations.
• A linear collection of data elements where the linear node is given by means of pointer is called?
• Literal means