Similar Search Results

Strongly regular graphs with parameters (4m 4, 2m 4 + m 2, m 4 + m 2, m 4 + m 2) exist for All m>1

Haemers, Willem H. (contributor); Xiang, Qing (contributor) - 2008

Persistent link: https://www.econbiz.de/10003777718

On the sum of Laplacian eigenvalues of graphs

Haemers, Willem H. (contributor); … - 2008

Persistent link: https://www.econbiz.de/10003777889

Cospectral graphs and the generalized adjacency matrix

Dam, Edwin Robert van (contributor); … - 2006

Persistent link: https://www.econbiz.de/10003324282

Graphs cospectral with Kneser graphs

Haemers, Willem H.; Ramezani, Farzaneh - 2009

Persistent link: https://www.econbiz.de/10003884416

Universal adjacency matrices with two eigenvalues

Haemers, Willem H.; Omidi, G. R. - 2010

Persistent link: https://www.econbiz.de/10008738467

The maximum order of adjacency matrices with a given rank

Haemers, Willem H.; Peeters, M. J. P. - 2010

Persistent link: https://www.econbiz.de/10008746128

The integral trees with spectral radius 3

Brouwer, A. E. (contributor); Haemers, Willem H. (contributor) - 2007

Persistent link: https://www.econbiz.de/10003674673

An odd characterization of the generalized odd graphs

Dam, Edwin Robert van; Haemers, Willem H. - 2010

Persistent link: https://www.econbiz.de/10003986941

Divisible design graphs

Haemers, Willem H.; Kharaghani, Hadi; Meulenberg, Maaike A. - 2010

Persistent link: https://www.econbiz.de/10003965549

Seidel switching and graph energy

Haemers, Willem H. - 2012

The energy of a graph T is the sum of the absolute values of the eigenvalues of the adjacency matrix of T. Seidel switching is an operation on the edge set of T. In some special cases Seidel switching does not change the spectrum, and therefore the energy. Here we investigate when Seidel...

Persistent link: https://www.econbiz.de/10009516701