Characterization of \alpha-excellent 2-trees

MaRDI QIDQ6415141zbMATH OpenFDO

Authors Magda Dettlaff, Michael A. Henning, Jerzy Topp

Publication date 25 October 2022

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

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.

This page was built for publication: Characterization of $\alpha$-excellent $2$-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415141)