Sail E0 Webinar
Question

What is the least no. of spanning trees possible using a complete graph with n vertices?



Options:
A .  n!
B .  2^n-1
C .  2^(n-1)-1
D .  (2n)!/((n+1)*n!*n!)
Answer: Option C


Submit Your Solution Below and Earn Points !
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos
Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)
Direction Sense Test Part 1 Reasoning (Hindi)
Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE
Cube & Cuboid Part 1 Reasoning (Hindi)
Data Interpretation (DI) Basic Concept Reasoning (Hindi)
Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)
Sail E0 free webinar Webinars
Real Numbers Part 7 Class 10 Maths
Real Numbers Part 1 Class 10 Maths
Polynomials Part 1 Class 10 Maths

Latest Test Papers

GPOE / GPA Combined 1 Free Mock Test SAIL JO E-0 2024
Chapter 3.1 : INTRODUCTION Chapter 3 : Sinter Plant SAIL E0 - GPOE/GPA 2024
Chapter 2.3 : COAL HANDLING PLANT - Set 1 Chapter 2 : Coke Ovens and Coal Chemicals SAIL E0 - GPOE/GPA 2024
Chapter 1.1 : INTRODUCTION Chapter 1 : Raw Material Handling Plant SAIL E0 - GPOE/GPA 2024
DSP Combined 1 Free Revision Test SAIL JO E-0