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.

Related MCQs

• Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
• 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 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            
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• 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                
• The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x is your friend” and let the domain be all people.
• The minimum number of edges in a connected cyclic graph on n vertices is
• The minimum number of edges in a connected graph with n vertices is ___________.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.