A spectral excess theorem for digraphs with normal Laplacian matrices

DOI10.22108/toc.2018.105873.1513zbMath1463.05354OpenAlexW2789779251MaRDI QIDQ5135463

Fateme Shafiei

Publication date: 20 November 2020

Full work available at URL: https://doaj.org/article/681be5446f7141c3acecc57c22e3f8c2

zbMATH Keywords

distance-regular digraphsstrongly regular digraphsLaplacian spectral excess theorem

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
• 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
• Spectra of 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
• A directed graph version of strongly regular graphs
• Locally pseudo-distance-regular graphs
• Distance-transitive and distance-regular digraphs
• Algebraic characterizations of distance-regular graphs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Weakly distance-regular digraphs.
• On almost distance-regular graphs
• Digraphs