Weakly Hadamard diagonalizable graphs
DOI10.1016/J.LAA.2020.09.038zbMATH Open1458.05136OpenAlexW3091117907MaRDI QIDQ2228102FDOQ2228102
Authors: Mohammad Adm, K. Meagher, S. Nasserasr, Mahsa N. Shirazi, A. Sarobidy Razafimahatratra, Khawla Al Muhtaseb, Shaun M. Fallat 
Publication date: 16 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.09.038
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Combinatorial Designs
- Title not available (Why is that?)
- The CRC handbook of combinatorial designs
- Title not available (Why is that?)
- Erdős-Ko-Rado theorems. Algebraic approaches
- Strongly regular graphs with smallest eigenvalue -m
- Title not available (Why is that?)
- Strongly regular graphs, partial geometries and partially balanced designs
- CLIQUE NUMBERS OF PALEY GRAPHS
- \(\{-1,0,1\}\)-basis for the null space of a forest
- On Hadamard diagonalizable graphs
- Maximal cliques in the Paley graph of square order
- Balancedly splittable Hadamard matrices
- Perfect quantum state transfer using Hadamard diagonalizable graphs
Cited In (6)
- Weakly transitive orientations, Hasse diagrams and string graphs
- The EKR-module property of pseudo-Paley graphs of square order
- On Hadamard diagonalizable graphs
- Hadamard diagonalizable graphs of order at most 36
- Complex Hadamard diagonalisable graphs
- Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs
This page was built for publication: Weakly Hadamard diagonalizable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228102)
