Bissoy.com
Doctors Medicines MCQs Q&A

The degree of any vertex of a graph is :

The degree of any vertex of a graph is : Correct Answer Number of vertices in a graph

Degree of a Vertex: In graph theory, the degree of a vertex is the number of edges/vertices connecting it. For example, vertex 0 and 2 have degree 2, and the rest have degree 3. A vertex with degree 1 is called an "end vertex".

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?
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 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.
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?
Study the following statements.i) The displacement method is more useful when degree of kinematic indeterminacy is greater than the degree of static indeterminacy.ii) The displacement method is more useful when degree of kinematic indeterminacy is less than the degree of static indeterminacy.iii) The force method is more useful when degree of static indeterminacy is greater than the degree of kinematic indeterminacy.iv) The force method is more useful when degree of static indeterminacy is less than the degree of kinematic indeterminacy.The correct answer is
A graph G has the degree of each vertex is ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤ 2|E| and 3|R| ≤ 2|E|, then the graph is said to be ________ (R denotes region in the graph)
G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is ______
The rear window of an automobile is made of thick glass i.e. AB = 5 mm and thermal conductivity is 0.8 W/m degree. To defrost this window, a thin transparent film type heating element has been fixed to its inner surface. For the conditions given below, determine the electric power that must be provided per unit area of window if a temperature 5 degree Celsius is maintained at its outer surface. Interior air temperature and the corresponding surface coefficient are 20 degree Celsius and 12 W/m2 degree. Surrounding air temperature and the corresponding surface coefficient are – 15 degree Celsius and 70 W/m2 degree. Electric heater provides uniform heat flux
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?