Graph Theory|A simple graph with n vertices must be connected if it has more than (n-1)(n-2)/2 edges

preview_player
Показать описание
Discrete Mathematics | MA3354 | Unit 3 | Graph Theory| A simple graph with n vertices must be connected if it has more than (n-1)(n-2)/2 edges

Discrete Mathematics:

Matrices and Calculus

2nd Sem Maths: Statistics & Numerical Methods

3rd Sem Maths: Transforms and Partial Differential Equations(MA3351):

3rd Sem Maths: Random Processes and Linear Algebra(MA3355):

MA3391 Probability and Statistics

MA3303:Probability and Complex Functions

4th Sem Maths: Vector Calculus And Complex Functions(MA3452)

Calculator tricks:

Рекомендации по теме
Комментарии
Автор

Didn’t understand the language but still understood the answer
Thats the language of maths❤

ajaychettri
Автор

Very useful and clear explanation ❤ thank you mam🎉

priyadharsinipriyadharsini