Weakly Hadamard diagonalizable graphs

DOI10.1016/J.LAA.2020.09.038MaRDI QIDQ2228102zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

eigenspacesHadamard matricesLaplaciansstrongly-regular graphs

Mathematics Subject Classification ID

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)

Recommendations

• On Hadamard diagonalizable graphs
• Hadamard diagonalizable graphs of order at most 36
• Complex Hadamard diagonalisable graphs
• Graphs represented by extended diagonal matrices
• Hadamard graphs. I

Cites work

• scientific article; zbMATH DE number 3777544 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Balancedly splittable Hadamard matrices
• CLIQUE NUMBERS OF PALEY GRAPHS
• Combinatorial Designs
• Erdős-Ko-Rado theorems. Algebraic approaches
• Maximal cliques in the Paley graph of square order
• On Hadamard diagonalizable graphs
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Strongly regular graphs with smallest eigenvalue -m
• Strongly regular graphs, partial geometries and partially balanced designs
• The CRC handbook of combinatorial designs
• \(\{-1,0,1\}\)-basis for the null space of a forest

Cited in

(6)

• Hadamard diagonalizable graphs of order at most 36
• On Hadamard diagonalizable graphs
• The EKR-module property of pseudo-Paley graphs of square order
• Weakly transitive orientations, Hasse diagrams and string graphs
• 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)