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

A)  n+e-1
B)  n-e+1
C)  e-n-1
D)  e-n+1

Correct Answer :   e-n+1

Explanation : We can remove maximum e-n+1 edges to get a spanning tree from complete graph. Any more deletion of edges will lead the graph to be disconnected.

Top Trending Technologies MCQ's
Machine Learning
Artificial Intelligence
IOT QUIZ
Blockchain
Deep Learning
Data Science
Keras
DevOps
Cyber Security
Ethical Hacking
Microsoft Azure
AWS
Cloud Computing
Quantum Computing
Edge Computing
ChatGPT
RPA
5G Network
Data Analytics
Neural Networks
Natural Language Processing
Networking
Virtual Reality
Augmented Reality
Angular
Node JS
React JS
C-Language
Java
More
Top Trending Technologies Interview Questions
Machine Learning
Artificial Intelligence
IOT QUIZ
Blockchain
Deep Learning
Data Science
LLM
ChatGPT
Metaverse
DevOps
Cyber Security
Ethical Hacking
HyperAutomation
Microsoft Azure
AWS
Cloud Computing
Quantum Computing
Edge Computing
Cognitive Computing
RPA
5G Network
Checkpoint
Neural Networks
Virtual Reality
Augmented Reality
Full Stack Developer
Web Services
Angular
Node JS
React JS
C-Language
CPP (or) C++
More