Edge-distance-regular graphs
From MaRDI portal
Publication:549255
DOI10.1016/j.jcta.2011.04.011zbMath1231.05083MaRDI QIDQ549255
E. Garriga, C. Dalfó, Miquel Àngel Fiol, M. Cámara, J. Fàbrega
Publication date: 7 July 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/14502
orthogonal polynomials; completely regular code; edge-distance-regular graph; generalized odd graph; spectral excess theorem
05E30: Association schemes, strongly regular graphs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An odd characterization of the generalized odd graphs
- A simple proof of the spectral excess theorem for distance-regular graphs
- The spectral excess theorem for distance-regular graphs: a global (over)view
- Developments on spectral characterizations of graphs
- On \(k\)-walk-regular graphs
- Feasibility conditions for the existence of walk-regular graphs
- Problems in algebraic combinatorics
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Boundary graphs: The limit case of a spectral property
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- On almost distance-regular graphs
- An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs
- On the algebraic theory of pseudo-distance-regularity around a set
