A graph is connected if minimum degree of each vertex is n-1

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Combinatorics, Graph Theory, Pegion Hole and tagged , . Bookmark the permalink.

Leave a comment