Let G be a simple graph with 15 vertices and 4 connected components. Prove that G has
Fantastic news! We've Found the answer you've been seeking!
Question:
Let G be a simple graph with 15 vertices and 4 connected components. Prove that G has at least one component with at least 4 vertices. What is the largest number of vertices that a component of G have? Compute the maximum number of edges of G?
Related Book For
Discrete Mathematics and Its Applications
ISBN: 978-0073383095
7th edition
Authors: Kenneth H. Rosen
Posted Date: