Graphs whose all maximal induced forests are of the same order

2021/05/29 by Reza Jafarpour-Golzari, Jafarpour-Golzari, Reza
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2105.14339

openalex publication_date 2021/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• On well-f-coveredness of lexicographic product of graphs
• Graphs in which all maximal bipartite subgraphs have the same order
• 1-well-covered graphs revisited
• Well-covered and uniformly well-covered graphs
• Well-indumatched Trees and Graphs of Bounded Girth