On $\alpha$-excellent graphs
Combinatorics
2022-08-19 v1
Abstract
A graph is -excellent if every vertex of is contained in some maximum independent set of . In this paper, we characterize -excellent bipartite graphs, -excellent unicyclic graphs, -excellent simplicial graphs, -excellent chordal graphs, -excellent block graphs, and we show that every generalized Petersen graph is -excellent.
Cite
@article{arxiv.2208.08498,
title = {On $\alpha$-excellent graphs},
author = {M. Dettlaff and M. A. Henning and J. Topp},
journal= {arXiv preprint arXiv:2208.08498},
year = {2022}
}
Comments
15 pages, 4 figures