A sharp upper bound for the number of st
β
Hongbo Hua
π
Article
π
2009
π
Elsevier Science
π
English
β 648 KB
Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.