A bound for the complexity of a simple g
β
Robert Grone; Russell Merris
π
Article
π
1988
π
Elsevier Science
π
English
β 310 KB
Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by