Let G be a connected graph and B, B0 be two bonds in G. Show that (B
Fantastic news! We've Found the answer you've been seeking!
Question:
Let G be a connected graph and B, B0 be two bonds in G. Show that (B ∪ B0 ) − e contains a bond for any edge e of G.
(Suggested approach: Show that the symmetric difference B4B0 is an edge cut, which must be a disjoint union of bonds.)
Related Book For
Discrete Mathematics and Its Applications
ISBN: 978-0073383095
7th edition
Authors: Kenneth H. Rosen
Posted Date: