Bounds on the Number of Vertex Independent Sets in a Graph

Abstract

We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP -complete. We present several upper and lower bounds for i(G) in terms of order, size or independence number. We obtain improved bounds for i(G) on restricted graph classes such as the bipartite graphs, unicyclic graphs, regular graphs and… (More)

Topics

Cite this paper

@inproceedings{Pedersen2004BoundsOT, title={Bounds on the Number of Vertex Independent Sets in a Graph}, author={Anders Sune Pedersen and Preben D. Vestergaard}, year={2004} }