On well-covered Cartesian products

Abstract

In 1970, Plummer defined a well-covered graph to be a graph G in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian product G H is well-covered, then at least one of G or H is well-covered. In this paper, we consider the problem of classifying all well-covered Cartesian products. In particular, we show that if the Cartesian product of two nontrivial, connected graphs of girth at least 4 is well-covered, then at least one of the graphs is K2. Moreover, we show that K2 K2 and C5 K2 are the only well-covered Cartesian products of nontrivial, connected graphs of girth at least 5.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…