On graphs having maximal independent sets of exactly $t$ distinct cardinalities
Combinatorics
2011-10-20 v1
Abstract
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and the length of the shortest cycle is at least 6t-6, we completely characterize such graphs.
Cite
@article{arxiv.1110.4310,
title = {On graphs having maximal independent sets of exactly $t$ distinct cardinalities},
author = {Bert L. Hartnell and Douglas F. Rall},
journal= {arXiv preprint arXiv:1110.4310},
year = {2011}
}
Comments
8 pages, 2 figures