#### Question

a.

e-n+1

b.

n-e+1

c.

n+e-1

d.

e-n-1

Posted under Data Structures and Algorithms

#### Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

###### Q. From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

## Similar Questions

###### Discover Related MCQs

Q. Minimum number of spanning tree in a connected graph is

View solution

Q. Find the odd out

View solution

Q. The minimum number of edges required to create a cyclid graph of n vertices is

View solution

Q. What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used −

View solution

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

View solution

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

View solution

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

View solution

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.

View solution

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.

View solution

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.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. A connected graph T without any cycles is called

View solution

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

View solution

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

View solution

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

View solution

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.

View solution

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

View solution

# Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!