On constructing rational spanning tree edge densities
From MaRDI portal
(Redirected from Publication:313824)
Recommendations
Cites work
- A recursion formula for resistance distances and its applications
- Degree sequence realizations with given packing and covering of spanning trees
- Degree sequences and graphs with disjoint spanning trees
- Enumeration of spanning trees in planar unclustered networks
- Enumeration of spanning trees on contact graphs of disk packings
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1933253 (Why is no real title available?)
- scientific article; zbMATH DE number 953290 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- New method for counting the number of spanning trees in a two-tree network
- Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
- Resistance distance and the normalized Laplacian spectrum
- The number of spanning trees in Apollonian networks
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
Cited in
(2)
This page was built for publication: On constructing rational spanning tree edge densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313824)