A graph is alpha-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the alpha-excellent 2-trees.
University of Johannesburg
132588 / Academy of Finland (AKA); Research Council of Finland
132588 / South African National Research Foundation; National Research Foundation - South Africa
Identifiers
9958207807691
Copyright
Authors 2025
Publication Details
1234-3099
Academic Unit
University of Johannesburg; Faculty of Science; Department of Mathematics and Applied Mathematics