Let G be a simple graph. δ(G) is the minimum vertex degree. Prove that if M is the maximum matching, then δ(G)/2 ≤ |M|.
How to prove this?
Let G be a simple graph. δ(G) is the minimum vertex degree. Prove that if M is the maximum matching, then δ(G)/2 ≤ |M|.
How to prove this?
Copyright © 2021 JogjaFile Inc.