On \alpha-excellent graphs

DOI10.1007/S40840-022-01456-0MaRDI QIDQ6408147arXivFDO

Authors Magda Dettlaff, Michael A. Henning, Jerzy Topp

Publication date 17 August 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/S40840-022-01456-0

Mathematics Subject Classification ID

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

arXiv classification

math.CO

Abstract: A graph $G$ is $alpha$-excellent if every vertex of $G$ is contained in some maximum independent set of $G$. In this paper, we characterize $alpha$-excellent bipartite graphs, $alpha$-excellent unicyclic graphs, $alpha$-excellent simplicial graphs, $alpha$-excellent chordal graphs, $alpha$-excellent block graphs, and we show that every generalized Petersen graph is $alpha$-excellent.

This page was built for publication: On $\alpha$-excellent graphs

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