Bissoy.com
Doctors Medicines MCQs Q&A

A grapgh having an edge from vertex to every other vertex is called.

A grapgh having an edge from vertex to every other vertex is called. Correct Answer "Lightly connected"

Related Questions

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?
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is 
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.
Seven people A, B, C, D, E, F and G live on separate floors of a 7-floor building. Ground floor is numbered 1, first floor is numbered. 2 and so on until the topmost floor is numbered 7. Each one of these having a different cars-Cadillac, Ambassador, Fiat, Maruti, Mercedes, Bedford and Fargo but not necessarily in the same order. Only three people live above the floor on which A lives. Only one person lives between A and the one having a car Cadillac. F lives immediately below the one having a car Bedford. The one having a car Bedford lives on an even-numbered floor. Only three people live between the ones having a car Cadillac and Maruti. E lives immediately above C. E is not having a car Maruti. Only two people live between B and the one having a car Fargo. The one having a car Fargo lives below the floor on which B lives. The one having a car Fiat does not live immediately above D or immediately below B. D does not live immediately above or immediately below A. G does not have a car Ambassador. Question : How many people live between the floors on which D and the one having a car Bedford ?
A graph having an edge from each vertex to every other vertex is called a ___________
G = (V, E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? I. If e is the lightest edge of some cycle in G, then every MST of G includes e II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e 
Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to TD. (A cross edge in G is between two nodes neither of which is an ancestor of the other in TD .) (II) For every edge (u, v) of if u is at depth i and v is at depth j in TB , then |? − ?| = 1. Which of the statements above must necessarily be true?
The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?