Abstract
A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. [1] provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.
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.
