Article ID Journal Published Year Pages File Type
4949978 Discrete Applied Mathematics 2016 9 Pages PDF
Abstract
Let τ(G) and τG(e) denote the number of spanning trees of a graph G and the number of spanning trees of G containing edge e of G, respectively. Ferrara, Gould, and Suffel asked if, for every rational 0

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On constructing rational spanning tree edge densities
Authors
,