Edge-distance-regular graphs
DOI10.1016/J.JCTA.2011.04.011zbMATH Open1231.05083OpenAlexW2168163195MaRDI QIDQ549255FDOQ549255
J. Fàbrega, C. Dalfó, Marc Cámara, Miquel Angel Fiol, E. Garriga
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
Recommendations
completely regular codeorthogonal polynomialsedge-distance-regular graphgeneralized odd graphspectral excess theorem
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Developments on spectral characterizations of graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- The spectral excess theorem for distance-regular graphs: a global (over)view
- Problems in algebraic combinatorics
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- On almost distance-regular graphs
- Feasibility conditions for the existence of walk-regular graphs
- Algebraic characterizations of 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
- An odd characterization of the generalized odd graphs
- A simple proof of the spectral excess theorem for distance-regular graphs
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- Boundary graphs: The limit case of a spectral property
- On \(k\)-walk-regular graphs
- Title not available (Why is that?)
Cited In (9)
- Edge-distance-regular graphs are distance-regular
- Completely regular clique graphs
- Title not available (Why is that?)
- Kite-free distance-regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-regular graphs with regular cliques
- Distance degree regular graphs
- A spectral excess theorem for normal digraphs
This page was built for publication: Edge-distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549255)