let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are

Related MCQs

• A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.
• Matrices with relatively high proportion of zero entries are called ______ matrices.
• In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
• 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.
• In a graph if e=(u, v) means
• 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