A path of a graph is said to be ______ if it contains all the edges of the graph.

Related MCQs

• 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).
• 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.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• 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                
• If two edges have same vertices as its terminal vertices those edges are called ____.
• 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?
•              is the maximum number of edges in an acyclic undirected graph with k vertices.
• The minimum number of edges in a connected cyclic graph on n vertices is
• The maximum number of edges in a 8- node undirected graph without self loops is
• What is the grade of a planar graph consisting of 8 vertices and 15 edges?