The following pages link to Willem H. Haemers (Q184651):
Displaying 50 items.
- On \((v,k,\lambda{})\) graphs and designs with trivial automorphism group (Q1813213) (← links)
- A (49,16,3,6) strongly regular graph does not exist (Q1824629) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- The complement of the path is determined by its spectrum (Q1855387) (← links)
- The Hermitian two-graph and its code (Q1855390) (← links)
- Interlacing eigenvalues and graphs (Q1899437) (← links)
- Distance-regularity and the spectrum of graphs (Q1911436) (← links)
- Binary codes of strongly regular graphs (Q1963158) (← links)
- Spectral symmetry in conference matrices (Q2168068) (← links)
- On NP-hard graph properties characterized by the spectrum (Q2197466) (← links)
- Universal spectra of the disjoint union of regular graphs (Q2199355) (← links)
- Spectra of strongly Deza graphs (Q2231732) (← links)
- Walk-regular divisible design graphs (Q2249653) (← links)
- Cospectral pairs of regular graphs with different connectivity (Q2296005) (← links)
- On the spectral characterization of mixed extensions of \(P_3\) (Q2315437) (← links)
- Spectral characterization of mixed extensions of small graphs (Q2317641) (← links)
- Graph switching, 2-ranks, and graphical Hadamard matrices (Q2317657) (← links)
- The graphs cospectral with the pineapple graph (Q2328092) (← links)
- The graphs with all but two eigenvalues equal to \(\pm 1\) (Q2346766) (← links)
- The graphs with all but two eigenvalues equal to \(-2\) or 0 (Q2364633) (← links)
- On 3-chromatic distance-regular graphs (Q2384050) (← links)
- Divisible design graphs (Q2431260) (← links)
- An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs (Q2442427) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- Regularity and the generalized adjacency spectra of graphs (Q2496664) (← links)
- Strongly regular graphs with strongly regular decomposition (Q2639877) (← links)
- Hoffman's ratio bound (Q2656649) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Seidel switching and graph energy (Q2856741) (← links)
- (Q3001405) (← links)
- The maximum order of reduced square (0,1)-matrices with a given rank (Q3166914) (← links)
- (Q3195097) (← links)
- (Q3222881) (← links)
- The chromatic index of strongly regular graphs (Q3390046) (← links)
- (Q3656236) (← links)
- (Q3866127) (← links)
- (Q3866128) (← links)
- (Q3879261) (← links)
- (Q3912601) (← links)
- (Q3931312) (← links)
- A Partial Geometry pg(9, 8, 4) (Q3955363) (← links)
- Strongly regular graphs induced by polarities of symmetric designs (Q3973795) (← links)
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph (Q4187729) (← links)
- (Q4276287) (← links)
- (Q4346787) (← links)
- (Q4357341) (← links)
- (Q4505272) (← links)
- Equitable resolvable coverings (Q4800408) (← links)
- Eigenvalues and the diameter of graphs (Q4853924) (← links)
- Graphs cospectral with distance-regular graphs (Q4853928) (← links)
