Number of distinct nodes in any elementary path of length p is ________.

Related MCQs

• The number of distinct simple graphs with up to three nodes is _________.
• For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?
• If a node v is reachable from node u then the path of minimum length u to v is called _____.
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
• A proof broken into distinct cases, where these cases cover all prospects, such proofs are known as                        
• If there are n distinct components in a statement then there are _______ combinations of values in the truth table.
• There are only five distinct Hasse diagrams for partially ordered sets that contain _______elements.
• If the edges of a walk W are distinct then W is called _________.
• If the vertices of a walk W are distinct then W is called __________.