Abstract

A new definition of matroid connectivity is introduced and its properties are investigated in this paper. Vertex connectivity of graphs is expressed in an algebraic form and generalized to matroids. This generalized connectivity is called the Whitney connectivity of matroids. It is shown that the Whitney connectivity of the polygon matroid of a graph is the same as the vertex connectivity of the graph provided the graph is connected. Various properties of Whitney matroid connectivity and comparison with Tutte connectivity are also examined.

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 call

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.