If the vertices of a walk W are distinct then W is called __________.

Related MCQs

• What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
• Let p denote the statement: “I finish my homework before dinner”, q: “It rains” and r: “I will go for a walk”, the representative of the following statement: if I finish my homework before dinner and it does not rain, then I will go for walk is
• If an edge e is said to join the vertices u and v then the vertices u and v are called __.
• If the edges of a walk W are distinct then W is called _________.
• If two edges have same vertices as its terminal vertices those edges are called ____.
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• The number of pendant vertices in a full binary tree with n vertices is ________.
• A binary tree with 2k vertices of level k has at least _______ vertices.
• If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
• Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called