Effective resistances and spanning trees in the complete bipartite graph plus a matching

DOI10.1016/j.dam.2021.09.008zbMath1485.05043OpenAlexW3199473744MaRDI QIDQ2235268

Yanyan Li

Publication date: 21 October 2021

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

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

zbMATH Keywords

complete bipartite graphspanning treeelectrical networkeffective resistance

Mathematics Subject Classification ID

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

Related Items

A type of generalized mesh-star transformation and applications in electrical networks, Algorithmic techniques for finding resistance distances on structured graphs, Minimal hexagonal chains with respect to the Kirchhoff index

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance in complete \(n\)-partite graphs
• Resistance distances and Kirchhoff index of graphs with an involution
• Resistance distance local rules
• Random walks and the effective resistance sum rules
• Enumerating spanning trees of graphs with an involution
• Resistance between two vertices of almost complete bipartite graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
• Algebraic Potential Theory on Graphs
• Linear Algebraic Techniques for Spanning Tree Enumeration
• Two-point resistances and random walks on stellated regular graphs