𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-numbering convention for setting up circuit and cut-set matrixes

✍ Scribed by Char, J.P.

Book ID
115504902
Publisher
Institution of Electrical Engineers
Year
1967
Weight
326 KB
Volume
114
Category
Article
ISSN
0020-3270

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
✍ 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.