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 2-trees.
| Original language | English |
|---|---|
| Pages (from-to) | 67-80 |
| Number of pages | 14 |
| Journal | Discussiones Mathematicae - Graph Theory |
| Volume | 45 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2025 |
Keywords
- excellent graph
- independence number
- k-tree
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics