Prove that a simple graph having n vertices and k components can have at most (n-1)(n-k+1)/2 edges.

Unit 1

B.Sc. III (Semester – VI ) [Paper XII]

(Graph Theory )

 Theorem:- Prove that a simple graph having n vertices and k components                       can have at most  (n-1)(n-k+1)/2    edges.    
Prove that a simple graph having n vertices and k components can have at most (n-1)(n-k+1)/2 edges.

Prove that a simple graph having n vertices and k components can have at most (n-1)(n-k+1)/2 edges.

Prove that a simple graph having n vertices and k components can have at most (n-1)(n-k+1)/2 edges.

Prove that a simple graph having n vertices and k components can have at most (n-1)(n-k+1)/2 edges.


======================================================
 Note:-
                   
If you are seeing it on mobile then please Enable Desktop site For better experience...

To Enable desktop site...

1) tap on the 3 dots located in the top right corner of your screen.
2) tap on " Desktop site".





Comments

Post a Comment