Abstract
For a graph G let μ ( G ) denote the cyclomatic number and let ν ( G ) denote the maximum number of edge-disjoint cycles of G . We prove that for every k ≥ 0 there is a finite set P ( k ) such that every 2-connected graph G for which μ ( G ) − ν ( G ) = k arises by applying a simple extension rule to a graph in P ( k ) . Furthermore, we determine P ( k ) for k ≤ 2 exactly.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.