Hadamard diagonalizable graphs of order at most 36

DOI10.37236/9725zbMATH Open1487.05153arXiv2007.09235OpenAlexW3043148448MaRDI QIDQ2138573FDOQ2138573

Authors: Yanyan Li 

Publication date: 12 May 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $pm1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard matrix and the graph is said to be Hadamard diagonalizable. In this article, we prove that if $n=8k+4$ the only possible Hadamard diagonalizable graphs are $K_n$, $K_{n/2,n/2}$, $2K_{n/2}$, and $n{K}_1$, and we develop an efficient computation for determining all graphs diagonalized by a given Hadamard matrix of any order. Using these two tools, we determine and present all Hadamard diagonalizable graphs up to order 36. Note that it is not even known how many Hadamard matrices there are of order 36.

Full work available at URL: https://arxiv.org/abs/2007.09235

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On Hadamard diagonalizable graphs
• Weakly Hadamard diagonalizable graphs
• Complex Hadamard diagonalisable graphs
• Hadamard graphs. I
• scientific article

zbMATH Keywords

Hadamard matrixLaplacian matrix of a graphHadamard diagonalizable graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Boolean and Hadamard matrices (15B34) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Practical graph isomorphism. II.
• Perfect state transfer in products and covers of graphs
• On Hadamard diagonalizable graphs
• Balancedly splittable Hadamard matrices
• Perfect quantum state transfer using Hadamard diagonalizable graphs
• Complex Hadamard diagonalisable graphs

Cited In (3)

• On Hadamard diagonalizable graphs
• Hadamard graphs. I
• Laplacian \(\{-1,0,1\}\)- and \(\{-1,1\}\)-diagonalizable graphs

Uses Software

• nauty
• Traces
• Hadamard
• GNU parallel

This page was built for publication: Hadamard diagonalizable graphs of order at most 36

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138573)