Hadamard diagonalizable graphs of order at most 36
Date
2020-07-17
Authors
Breen, Jane
Butler, Steve
Fuentes, Melissa
Lidicky, Bernard
Phillips, Michael
Riasanovsky, Alexander
Song, Sung-Yell
Villagrán, Ralihe
Wiseman, Cedar
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Lidicky, Bernard
Professor
Research Projects
Organizational Units
Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University.
From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
Abstract
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries ±1, 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 Kn, Kn/2,n/2, 2Kn/2, and nK1, 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.
Comments
This preprint is made available through arXiv: https://arxiv.org/abs/2007.09235.
Description
Keywords
Citation
DOI
Source
Copyright
Wed Jan 01 00:00:00 UTC 2020