The Well-Covered Dimension of Products of Graphs
Combinatorics
2015-03-13 v3
Abstract
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 is found, provided that has a largest greedy independent decomposition of length . Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
Keywords
Cite
@article{arxiv.1003.3968,
title = {The Well-Covered Dimension of Products of Graphs},
author = {Isaac Birnbaum and Megan Kuneli and Robyn McDonald and Katherine Urabe and Oscar Vega},
journal= {arXiv preprint arXiv:1003.3968},
year = {2015}
}
Comments
14 pages, 21 figures