Characterization of $\alpha$-excellent $2$-trees
Combinatorics
2022-10-27 v1
Abstract
A graph is -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 -excellent -trees.
Keywords
Cite
@article{arxiv.2210.14387,
title = {Characterization of $\alpha$-excellent $2$-trees},
author = {Magda Dettlaff and Michael A. Henning and Jerzy Topp},
journal= {arXiv preprint arXiv:2210.14387},
year = {2022}
}
Comments
10 pages, 3 figures