On constructing rational spanning tree edge densities

DOI10.1016/j.dam.2016.05.008zbMath1344.05047OpenAlexW2436577146MaRDI QIDQ313824

Nathan Kahl

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.008

zbMATH Keywords

random walks on graphsresistance distancespanning trees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)

Related Items

On two conjectures concerning spanning tree edge dependences of graphs

Cites Work

• Degree sequences and graphs with disjoint spanning trees
• Resistance distance and the normalized Laplacian spectrum
• Enumeration of spanning trees on contact graphs of disk packings
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• New method for counting the number of spanning trees in a two-tree network
• Enumeration of spanning trees in planar unclustered networks
• Degree sequence realizations with given packing and covering of spanning trees
• Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs
• A recursion formula for resistance distances and its applications
• The number of spanning trees in Apollonian networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On constructing rational spanning tree edge densities