Abstract
A matching M in a graph G is maximal if it cannot be extended to a larger matching in G . In this paper we show how several chemical and technical problems can be successfully modeled in terms of maximal matchings. We introduce the maximal matching polynomial and study its basic properties. Then we enumerate maximal matchings in several classes of graphs made by a linear or cyclic concatenation of basic building blocs. We also count maximal matchings in joins and corona products of some classes of graphs.
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.