Weakly distance-regular digraphs.
From MaRDI portal
Publication:1426099
DOI10.1016/j.jctb.2003.07.003zbMath1033.05100OpenAlexW2008049272WikidataQ57772716 ScholiaQ57772716MaRDI QIDQ1426099
Margarida Mitjana, Miquel Àngel Fiol, Joan Gimbert, Francesc Comellas
Publication date: 14 March 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2003.07.003
SpectrumOrthogonal polynomialsAdjacency matrixButterfly digraphCycle prefix digraphDistance-regular digraph
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Multipartite Moore digraphs ⋮ Directed strongly walk-regular graphs ⋮ The spectra of some families of digraphs ⋮ Minimum cuts of distance-regular digraphs ⋮ A spectral excess theorem for normal digraphs ⋮ The spectra of Manhattan street networks ⋮ A spectral excess theorem for digraphs with normal Laplacian matrices ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Some constructions of quasi-strongly regular digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The girth of a directed distance-regular graph
- Inertia characteristics of self-adjoint matrix polynomials
- Certain distance-regular digraphs and related rings of characteristic 4
- Distance-regular digraphs of girth 4
- A directed graph version of strongly regular graphs
- Distance transitive digraphs
- Distance-transitive and distance-regular digraphs
- Nonexistence of certain distance-transitive digraphs
- Problems in algebraic combinatorics
- Algebraic characterizations of distance-regular graphs
- Hamilton circuits in the directed wrapped Butterfly network
- Vertex-symmetric digraphs with small diameter
- Weakly distance-regular digraphs
- Cycle prefix digraphs for symmetric interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
- Cayley Digraphs Based on the de Bruijn Networks
- The Spectra of Cycle Prefix Digraphs
- Compressing cube-connected cycles and butterfly networks
This page was built for publication: Weakly distance-regular digraphs.