Shortest paths in distance-regular graphs

DOI10.1006/EUJC.1999.0269MaRDI QIDQ1971798zbMATH OpenOpenAlexFDO

Authors Enrique Bendito, A. Carmona, A. M. Encinas

Publication date 3 December 2000

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/94c4a81d19ee224615c8fd31c6ff9353c52fab2b

zbMATH Keywords

kernelshortest pathsdistance-regular graphLaplacianstrongly regular graphscharacterizationequilibrium problemequilibrium measureenergy principles

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• On electric resistances for distance-regular graphs
• Potential Theory on Distance-Regular Graphs
• Two Laplacians for the distance matrix of a graph
• On the Cheeger constant for distance-regular graphs
• A bound for the diameter of distance-regular graphs

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A maximum principle for node voltages in finitely structured, transfinite, electrical networks
• Algebraic Potential Theory on Graphs
• Eigenvalues and the diameter of graphs
• Eigenvalues, diameter, and mean distance in graphs
• Eigenvalues, eigenspaces and distances to subsets
• Espaces de Dirichlet. I: Le cas élémentaire
• Extremum problems on an infinite network
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Minimizing energy on locally compact spaces: existence and approximation
• On a class of polynomials and its relation with the spectra and diameters of graphs
• On the theory of potentials in locally compact spaces
• Open problems of Paul Erd�s in graph theory
• Potential Theory on Distance-Regular Graphs
• Problems in algebraic combinatorics
• Random walks on finitely structured transfinite networks
• The extremal length of a network
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

Cited in

(11)

• The \(M\)-matrix group inverse problem for distance-biregular graphs
• An MBO scheme for minimizing the graph Ohta-Kawasaki functional
• Boundary value problems on planar graphs and flat surfaces with integer cone singularities. II: The mixed Dirichlet-Neumann problem
• Solving Dirichlet and Poisson problems on graphs by means of equilibrium measures
• Solving boundary value problems on networks using equilibrium measures
• Shortest paths in reachability graphs
• On electric resistances for distance-regular graphs
• Potential theory for Schrödinger operators on finite networks
• Energy and length in a topological planar quadrilateral
• Boundary value problems on planar graphs and flat surfaces with integer cone singularities, I: The Dirichlet problem
• On the fastest moving off from a vertex in directed regular graphs

This page was built for publication: Shortest paths in distance-regular graphs

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