Weakly Hadamard diagonalizable graphs

DOI10.1016/j.laa.2020.09.038zbMath1458.05136OpenAlexW3091117907MaRDI QIDQ2228102

Mohammad Adm, Karen Meagher, Mahsa N. Shirazi, Shahla Nasserasr, A. Sarobidy Razafimahatratra, Shaun M. Fallat, Khawla Al Muhtaseb

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

zbMATH Keywords

Hadamard matriceseigenspacesLaplaciansstrongly-regular graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

The EKR-module property of pseudo-Paley graphs of square order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hadamard diagonalizable graphs
• Strongly regular graphs with smallest eigenvalue -m
• Maximal cliques in the Paley graph of square order
• Balancedly splittable Hadamard matrices
• \(\{-1,0,1\}\)-basis for the null space of a forest
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Strongly regular graphs, partial geometries and partially balanced designs
• CLIQUE NUMBERS OF PALEY GRAPHS
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Combinatorial Designs

This page was built for publication: Weakly Hadamard diagonalizable graphs