Abstract
A basis for the cycle space of a graph is said to be robust if any cycle Z of G is a sum Z=C1+C2+⋯+Ck of basis elements such that (i) (C1+C2+⋯+Cℓ−1)∩Cℓ is a nontrivial path for each 2≤ℓ<k. Hence, (ii) each partial sum C1+C2+⋯+Cℓ is a cycle for 1≤ℓ≤k. While complete graphs and 2-connected plane graphs have robust cycle bases, it is shown that regular complete bipartite graphs Kn,n do not have any robust cycle basis if n≥8.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
