Q. A connected graph with n nodes and n-1 edges is called a?

n नोड्स और n-1 किनारों वाले कनेक्टेड ग्राफ़ को a कहा जाता है?

A
Complete Graph
B
Tree
C
Bipartite Graph
D
Disconnected Graph

Explanation

Explanation will be available soon. Please stay tuned.

व्याख्या जल्द ही उपलब्ध होगी। कृपया बने रहें।

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

More From This Topic

Related Questions

Related Topics

Basics of C++ and There Classes & Object Stacks and Queues Object-Oriented Concepts Elementary Data Types Arrays, Linked Lists Graphs

Comments

Leave a Comment

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

People Also Search For

Illustration of a clipboard with a checklist and pencil, bright and colorful style

Ready for a Challenge?

Take our Free timed mock tests to sharpen your skills and boost your confidence!