A connected graph T without any cycles is called

Related MCQs

• In a graph if e=[u, v], Then u and v 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.
• 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
• If every node u in G is adjacent to every other node v in G, A graph is said to be
• A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
• A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
• When representing any algebraic expression E the following uses only binary operations in a 2-tree
• Nodes that are not root and not leaf are called as internal nodes.