Directed strongly walk-regular graphs

DOI10.1007/s10801-017-0789-8zbMath1394.05145arXiv1508.05281OpenAlexW3103368965WikidataQ59513413 ScholiaQ59513413MaRDI QIDQ1668674

Gholam Reza Omidi, van Dam, Edwin R.

Publication date: 29 August 2018

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.05281

zbMATH Keywords

eigenvaluesspectrumwalkstrongly regular digraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of digraphs
• A directed graph version of strongly regular graphs
• Distance-transitive and distance-regular digraphs
• Directed graphs with unique paths of fixed length
• On some solutions of \(A^k=dI+\lambda J\)
• Weakly distance-regular digraphs.
• Generating regular directed graphs
• Strongly walk-regular graphs
• Representations of directed strongly regular graphs
• The Polynomial of a Directed Graph
• Directed strongly regular graphs with \(\mu=\lambda\)

This page was built for publication: Directed strongly walk-regular graphs