On well-f-coveredness of lexicographic product of graphs

2021/08/20 by Reza Jafarpour-Golzari, Jafarpour-Golzari, Reza
Computer Science · Mathematics · #05C76 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Primary: 05C70 #Secondary: 05C38 #math.CO #msc:05C38 #msc:05C70 #msc:05C76

paper · pdf · doi:10.48550/arxiv.2108.09146

10 pages; 2 figures

arxiv created 2021/08/20 · openalex publication_date 2021/08/20 · arxiv updated 2021/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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 graphs in case where the first component is empty, is characterized. In cases where the second component is empty, and the second component is nonempty, a necessary condition is given, and in each one, by an example, it is shown that the given condition is not sufficient.

Related

• Graphs whose all maximal induced forests are of the same order
• On the Cartesian product of non well-covered graphs
• On well-covered direct products
• On well-covered Cartesian products
• Well-covered and uniformly well-covered graphs