Discrete Maths|GraphTheory|The maximum number of edges in a simple graph with n vertices is n(n−1)/2

Discrete Mathematics | MA3354 | Unit 3 | Graph Theory | The maximum number of edges in a simple graph with n vertices is n(n−1)/2

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:

[LSAP-zmlg]

Can you make it's conversation in English or Hindi

[leoaruna]

Mam, 2nd ah teach panna theorem ah 8 mark la ketta hand shaking theorem stmt+proof and prev. Theorem (the deg. Of vertex of G on An vertices can't exceed n-1) oda stmt avathu eluthunga nu soningala ?
Appo first hand shaking theorem stmt and proof, next n-1 thorem oda stmt ethulam eluthitu n(n-1)/2 theorem oda stmt, proof eluthanuma, illana n(n-1)/2 theorem oda proof la HST, n-1 theorem stmt and proofs ah include pananuma ?