Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1
AbstractUsing results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 +m2,m4 +m2,m4 +m2). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by Gutman) among all graphs on 4m4 vertices. For odd m>3 the strongly regular graphs seem to be new.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2008-86.
Date of creation: 2008
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Cayley graph; difference set; energy of a graph; Hadamard matrix; regular Hadamard matrix; strongly regular graph; Seidel switching.;
Find related papers by JEL classification:
- C0 - Mathematical and Quantitative Methods - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-01-31 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.