A spectral excess theorem for normal digraphs
From MaRDI portal
Publication:494302
DOI10.1007/s10801-015-0590-5zbMath1319.05062arXiv1310.7382OpenAlexW1989059090MaRDI QIDQ494302
Publication date: 31 August 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7382
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- On some approaches to the spectral excess theorem for nonregular graphs
- A spectral excess theorem for nonregular graphs
- Dual concepts of almost distance-regularity and the spectral excess theorem
- A short proof of the odd-girth theorem
- Edge-distance-regular graphs
- Spectra of graphs
- 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
- 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 and distance-regular digraphs
- Spectral characterization of some generalized odd graphs
- Spectral characterization of odd graphs \(O_ k, k\leq 6\)
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Weakly distance-regular digraphs.
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- On almost distance-regular graphs
- Digraphs
This page was built for publication: A spectral excess theorem for normal digraphs