Well-indumatched Pseudoforests

Abstract

A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) 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. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.