A sharp upper bound for the number of stable sets in graphs with given number of cut edges

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.