Hadamard diagonalizable graphs of order at most 36

DOI10.37236/9725zbMath1487.05153arXiv2007.09235OpenAlexW3043148448MaRDI QIDQ2138573

Yanyan Li

Publication date: 12 May 2022

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

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

zbMATH Keywords

Hadamard matrixLaplacian matrix of a graphHadamard diagonalizable graph

Mathematics Subject Classification ID

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

Uses Software

• nauty
• Traces
• Hadamard
• GNU parallel

Cites Work

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

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