Spanning 2-forests and resistance distance in 2-connected graphs

DOI10.1016/j.dam.2020.03.061zbMath1443.05103arXiv1901.00053OpenAlexW3019213358MaRDI QIDQ777403

Mark Kempton, John Sinkovic, Amanda E. Francis, Emily. J. Evans, Wayne W. Barrett

Publication date: 7 July 2020

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

Full work available at URL: https://arxiv.org/abs/1901.00053

zbMATH Keywords

resistance distanceeffective resistance2-connected graph2-tree2-path2-separatorspanning 2-forest

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

Algorithmic techniques for finding resistance distances on structured graphs ⋮ The Braess' paradox for pendent twins ⋮ Resistance distance and spanning 2-forest matrices of linear 2-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Resistance distance and the normalized Laplacian spectrum
• Spanning trees on the Sierpinski gasket
• Resistance distance in wheels and fans
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• Resistance distance in straight linear 2-trees
• Some two-point resistances of the Sierpinski gasket network
• A recursion formula for resistance distances and its applications
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Graphs and matrices
• Graph Sparsification by Effective Resistances

This page was built for publication: Spanning 2-forests and resistance distance in 2-connected graphs