@techreport{56d51040321c445d97b2aeaa418597df,

title = "Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1",

abstract = "Using 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.",

keywords = "Cayley graph, difference set, energy of a graph, Hadamard matrix, regular Hadamard matrix, strongly regular graph, Seidel switching.",

author = "W.H. Haemers and Q. Xiang",

note = "Subsequently published in European Journal of Combinatorics, 2010 Pagination: 9",

year = "2008",

language = "English",

volume = "2008-86",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}