13. Prove that any undirected, loop-free graph on n vertices with at least (n − 1)(n − 2)/2 + 1edges is connected. Also, give an example of a disconnected n-vertex graph with one fewer edge.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 80EQ
icon
Related questions
Question

13. Prove that any undirected, loop-free graph on n vertices with at least (n − 1)(n − 2)/2 + 1
edges is connected. Also, give an example of a disconnected n-vertex graph with one fewer edge.

Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer