Graphs with minimal well-covered dimension
Combinatorics
2014-11-25 v3
Abstract
There is a class of graphs with well-covered dimension equal to the simplicial clique number that contains all chordal graphs and infinitely many other graphs. These graphs generalize a result by Brown and Nowakowski on the well-covered dimension of chordal graphs. Furthermore, each member of the infinite family of Sierpinski gasket graphs of order at least has well-covered dimension the simplicial clique number.
Keywords
Cite
@article{arxiv.1408.2593,
title = {Graphs with minimal well-covered dimension},
author = {Gabriella Clemente},
journal= {arXiv preprint arXiv:1408.2593},
year = {2014}
}
Comments
Revised version