W
Willem H. Haemers
Researcher at Tilburg University
Publications - 177
Citations - 7848
Willem H. Haemers is an academic researcher from Tilburg University. The author has contributed to research in topics: Adjacency matrix & Strongly regular graph. The author has an hindex of 36, co-authored 176 publications receiving 7021 citations. Previous affiliations of Willem H. Haemers include Polytechnic University of Catalonia.
Papers
More filters
BookDOI
Spectra of graphs
TL;DR: This book gives an elementary treatment of the basic material about graph Spectra, both for ordinary, and Laplace and Seidel spectra, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics.
Journal ArticleDOI
Which graphs are determined by their spectrum
Edwin van Dam,Willem H. Haemers +1 more
TL;DR: For almost all graphs the answer to the question in the title is still unknown as mentioned in this paper, and the cases for which the answer is known are surveyed in the survey of cases where the Laplacian matrix is known.
Posted Content
Which graphs are determined by their spectrum
Edwin van Dam,Willem H. Haemers +1 more
TL;DR: For almost all graphs the answer to the question in the title is still unknown as mentioned in this paper, and the cases for which the answer is known are surveyed in the survey of cases where the Laplacian matrix is known.
Journal ArticleDOI
Interlacing eigenvalues and graphs
TL;DR: In this paper, bounds are obtained for characteristic numbers of graphs, such as the size of a maximal clique, the chromatic number, the diameter, and the bandwidth, in terms of the eigenvalues of the standard adjacency matrix or the Laplacian matrix.
Journal ArticleDOI
Zero forcing sets and the minimum rank of graphs
Francesco Barioli,Wayne Barrett,Steve Butler,Sebastian M. Cioabă,Dragoš Cvetković,Shaun M. Fallat,Chris Godsil,Willem H. Haemers,Leslie Hogben,Rana Mikkelson,Sivaram K. Narayan,Olga Pryporova,Irene Sciriha,Wasin So,Dragan Stevanović,Hein van der Holst,Kevin N. Vander Meulen,Amy Wangsness Wehe +17 more
TL;DR: In this article, the minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i 6 j) is nonzero whenever {i,j} is an edge in G and is zero otherwise.