In a graph if e=[u, v], Then u and v are called

Related MCQs

• A connected graph T without any cycles is 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
• If a, b and c are integer variables with the values a=8, b=3 and c=-5. Then what is the value of the arithmetic expression: 2 * b + 3 * (a-c)
• If s1 is "ABC" and s2 is "DEF" then strcat(s1,s2)will give the following result.