Vega, Oscar; Birnbaum, Isaac; Kuneli, Megan; Urabe, Katherine; McDonald, Robyn
(De Gruyter, 2014)
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found,provided ...