1 citations · 2 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
On well-f-coveredness of lexicographic product of graphs
Reza Jafarpour-Golzari
A simple graph G is said to be well-f-covered, whenever any two maximal induced forest in G be of the same order. In this note, well-f-coveredness of lexicographic product of two g…
math.CO2021★ 1 cited
Graphs whose all maximal induced forests are of the same order
Reza Jafarpour-Golzari
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.…