PreprintCC BY 4.0arXiv
On graphs whose powers are well-covered
Abstract
In this paper, we investigate graphs with the property that all of their powers are well-covered. We obtain complete classifications for several graph classes, including chordal graphs, cochordal graphs, and very well-covered graphs.
Related
- Well-Covered Powers: Cartesian Products and Cayley Graphs
- Monomial ideals whose all matching powers are Cohen–Macaulay
- The maximum number of edges in minimal matching covered graphs
- The maximum size of simple solid matching covered graphs
- Planar graphs whose second largest eigenvalue does not exceed 1
BibTeX
@misc{pham2026graphs,
title = {{On graphs whose powers are well-covered}},
author = {My Hanh Pham and Thanh Vu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09300},
eprint = {2610.09300},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09300},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On graphs whose powers are well-covered
AU - My Hanh Pham
AU - Thanh Vu
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.09300
UR - https://arxiv.org/abs/2610.09300
AB - In this paper, we investigate graphs with the property that all of their powers are well-covered. We obtain complete classifications for several graph classes, including chordal graphs, cochordal graphs, and very well-covered graphs.
ER -