Potential Theory on Distance-Regular Graphs

DOI10.1017/S096354830000064XzbMath0793.94007MaRDI QIDQ4289291

Norman L. Biggs

Publication date: 16 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

networkdistance-regular graphseffective resistance

Mathematics Subject Classification ID

Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)

Related Items (17)

Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures ⋮ Resistance characterizations of equiarboreal graphs ⋮ Extremal hitting times of trees with some given parameters ⋮ A collection of results concerning electric resistance and simple random walk on distance-regular graphs ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ The expected hitting times for graphs with cutpoints. ⋮ A recursion formula for resistance distances and its applications ⋮ The expected hitting times for finite Markov chains ⋮ Shortest paths in distance-regular graphs ⋮ The Dirichlet boundary value problems forp-Schrödinger operators on finite networks ⋮ Edge-disjoint spanning trees and forests of graphs ⋮ Resistance distance of blowups of trees ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ Calculating effective resistances on underlying networks of association schemes ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs ⋮ On the resistance matrix of a graph

Cites Work

• Unnamed Item
• Resistances and currents in infinite electrical networks
• An introduction to covering problems for random walks on graphs
• An Algebraic Proof of Kirchhoff's Network Theorem
• Algebraic Graph Theory

This page was built for publication: Potential Theory on Distance-Regular Graphs