adplus-dvertising
frame-decoration

Question

Maximum degree of any vertex in a simple graph of vertices n is

a.

2n - 1

b.

n

c.

n + 1

d.

n - 1

Answer: (d).n - 1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Maximum degree of any vertex in a simple graph of vertices n is

Similar Questions

Discover Related MCQs

Q. If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is −

Q. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Q. State True of False.

i) Network is a graph that has weights or costs associated with it.

ii) An undirected graph which contains no cycles is called a forest.

iii) A graph is said to be complete if there is no edge between every pair of vertices.

Q. State True or False.

i) An undirected graph which contains no cycles is called forest.

ii) A graph is said to be complete if there is an edge between every pair of vertices.

Q. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

Q. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.

Q. A ……….. is a graph that has weights of costs associated with its edges.

Q. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

Q. In a graph if e=[u, v], Then u and v are called

Q. A connected graph T without any cycles is called

Q. In a graph if e=(u, v) means

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be

Q. Other name for directed graph is ..........

Q. Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

Q. A connected graph T without any cycles is called ........

Q. In a graph if E=(u,v) means ......

Q. Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

Q. Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

Q. For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

Q. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?