If the edges of a walk W are distinct then W is called _________.

Related MCQs

• 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 the vertices of a walk W are distinct then W is called __________.
• If two edges have same vertices as its terminal vertices those edges are called ____.
• A              is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• 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                
• Edges intersect only at their ends are called ________.
• A proof broken into distinct cases, where these cases cover all prospects, such proofs are known as                        
• For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?