On Hadamard diagonalizable graphs
From MaRDI portal
Publication:551311
DOI10.1016/j.laa.2011.03.033zbMath1221.05228OpenAlexW1967520751MaRDI QIDQ551311
Publication date: 15 July 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.03.033
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Balancedly splittable Hadamard matrices ⋮ Hadamard diagonalizable graphs of order at most 36 ⋮ Perfect quantum state transfer using Hadamard diagonalizable graphs ⋮ Co-eigenvector graphs ⋮ Complex Hadamard diagonalisable graphs ⋮ Laplacian spectra of cographs: a twin reduction perspective ⋮ Weakly Hadamard diagonalizable graphs ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Fundamentals of fractional revival in graphs ⋮ The EKR-module property of pseudo-Paley graphs of square order
Cites Work
- Unnamed Item
- Retracts of strong products of graphs
- Laplace eigenvalues of graphs---a survey
- On certain eigenspaces of cographs
- Complement reducible graphs
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- On graphs with algebraic connectivity equal to minimum edge density
- \(\{-1,0,1\}\)-basis for the null space of a forest
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- The Laplacian Spectrum of a Graph
- Fast generation of regular graphs and construction of cages
- A survey of graph laplacians
- On graphs whose Laplacian matrices have distinct integer eigenvalues
This page was built for publication: On Hadamard diagonalizable graphs