On the weak distance-regularity of Moore-type digraphs

DOI10.1080/03081080500423825zbMath1091.05042OpenAlexW2070628338WikidataQ57772705 ScholiaQ57772705MaRDI QIDQ5478713

Francesc Comellas, Joan Gimbert, Margarida Mitjana, Miquel Àngel Fiol

Publication date: 13 July 2006

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080500423825

zbMATH Keywords

Line digraphMoore digraphsAdjacency spectrumWeakly distance-regular digraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Multipartite Moore digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-transitive and distance-regular digraphs
• Coherent configurations. I: Ordinary representation theory
• On the impossibility of directed Moore graphs
• Large generalized cycles
• On the matrix equation \(A^l+A^{l+k}=J_n\)
• Algebraic characterizations of distance-regular graphs
• On the structure of digraphs with order close to the Moore bound
• Weakly distance-regular digraphs.
• Almost Moore digraphs are diregular
• Isoperimetric numbers of graphs
• On Moore Graphs with Diameters 2 and 3
• Line Digraph Iterations and the (d, k) Digraph Problem
• On the Polynomial of a Graph
• On Moore bipartite digraphs
• The spectra of wrapped butterfly digraphs
• Complete characterization of almost Moore digraphs of degree three
• Digraphs of degree 3 and order close to the moore bound
• Dense bipartite digraphs
• Enumeration of almost Moore digraphs of diameter two
• The underlying line digraph structure of some (0, 1)-matrix equations

This page was built for publication: On the weak distance-regularity of Moore-type digraphs