Potential Theory on Distance-Regular Graphs

DOI10.1017/S096354830000064XMaRDI QIDQ4289291zbMATH OpenFDO

Authors Norman L. Biggs

Publication date 16 August 1994

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

Full work available at URL https://doi.org/10.1017/S096354830000064X

zbMATH Keywords

distance-regular graphseffective resistancenetwork

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1047714
• Potential theory on finite graphs
• scientific article; zbMATH DE number 5896456
• Algebraic Potential Theory on Graphs
• Theorie du Potentiel sur les Graphes et les Varietes
• scientific article; zbMATH DE number 4186788
• Distance-regularity and the spectrum of graphs
• Potential theory on trees, graphs and Ahlfors-regular metric spaces
• Potential theory on trees, graphs and Ahlfors-regular metric spaces
• scientific article; zbMATH DE number 47845

Cites work

• Algebraic Graph Theory
• An Algebraic Proof of Kirchhoff's Network Theorem
• An introduction to covering problems for random walks on graphs
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Resistances and currents in infinite electrical networks

Cited in

(29)

• The expected hitting times for graphs with cutpoints.
• Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures
• On electric resistances for distance-regular graphs
• Shortest paths in distance-regular graphs
• 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
• On (almost) 2-Y-homogeneous distance-biregular graphs
• On the (reverse) cover cost of trees with some given parameters
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Resistance characterizations of equiarboreal graphs
• A recursion formula for resistance distances and its applications
• On the resistance matrix of a graph
• The Dirichlet boundary value problems for p-Schrödinger operators on finite networks
• Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
• scientific article; zbMATH DE number 1047714 (Why is no real title available?)
• Algebraic Potential Theory on Graphs
• Extremal hitting times of trees with some given parameters
• Calculating two-point resistances in distance-regular resistor networks
• Calculating effective resistances on underlying networks of association schemes
• Effective graph resistance
• scientific article; zbMATH DE number 2217106 (Why is no real title available?)
• Average hitting times in some f-equitable graphs
• Resistance distance in blowup graphs
• Explicit formulas for matrices associated to ladder, circular ladder, and Möbius ladder graphs
• A collection of results concerning electric resistance and simple random walk on distance-regular graphs
• Resistances and currents in infinite electrical networks
• The expected hitting times for finite Markov chains
• Evaluation of effective resistances in pseudo-distance-regular resistor networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289291)