Characterization of $\alpha$-excellent $2$-trees

Abstract

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.

10 pages, 3 figures