Shortest paths in distance-regular graphs

DOI10.1006/eujc.1999.0269zbMath0949.05046OpenAlexW1981712105MaRDI QIDQ1971798

Enrique Bendito, Ángeles Carmona, Andrés 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

distance-regular graphstrongly regular graphscharacterizationLaplacianshortest pathskernelequilibrium measureequilibrium problemenergy principles

Mathematics Subject Classification ID

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

Related Items (8)

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

Cites Work

• Unnamed Item
• Espaces de Dirichlet. I: Le cas élémentaire
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The extremal length of a network
• Eigenvalues, diameter, and mean distance in graphs
• Extremum problems on an infinite network
• Problems in algebraic combinatorics
• Eigenvalues, eigenspaces and distances to subsets
• A maximum principle for node voltages in finitely structured, transfinite, electrical networks
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Random walks on finitely structured transfinite networks
• On the theory of potentials in locally compact spaces
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Potential Theory on Distance-Regular Graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Algebraic Potential Theory on Graphs
• Minimizing energy on locally compact spaces: existence and approximation
• Eigenvalues and the diameter of graphs

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