Abstract
Let G be a simple graph with |V(G)| = n and no isolated vertices. Let α be its stability number. We study invariants of the edge-ring of G that can be interpreted as invariants of G. If G has a cover by maximum stable sets we are able to prove the inequality . As a byproduct we prove that if G is vertex-critical, then α ≤ (n − |A|)/2, where A is the intersection of all the minimum vertex covers of G. We estimate the smallest number of vertices in any maximal stable set of G to obtain a bound for the depth of the edge-ring of G. #Communicated by R. Villarreal.

This publication has 11 references indexed in Scilit: