Graphs whose all maximal induced forests are of the same order
Combinatorics
2021-06-01 v1
Abstract
In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining large well-f-covered graphs from smaller ones. By the way, some interesting classes of well-f-covered graphs are characterized.
Keywords
Cite
@article{arxiv.2105.14339,
title = {Graphs whose all maximal induced forests are of the same order},
author = {Reza Jafarpour-Golzari},
journal= {arXiv preprint arXiv:2105.14339},
year = {2021}
}