scientific article

From MaRDI portal
Publication:3866128

zbMath0429.05013MaRDI QIDQ3866128

Willem H. Haemers

Publication date: 1980


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

A survey of some problems in combinatorial designs - a matrix approach, Biregular graphs with three eigenvalues, Collapse of the metric hierarchy for bipartite graphs, Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme, On the number of matroids, Uniqueness of strongly regular graphs having minimal \(p\)-rank, Generalized quadrangles with a regular point and association schemes, Regular graphs with four eigenvalues, Toughness and spectrum of a graph, Interlacing eigenvalues and graphs, Strongly regular graphs with strongly regular decomposition, Distance-regularity and the spectrum of graphs, New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\), Interesting pointsets in generalized quadrangles and partial geometries, New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs, Hoffman's ratio bound, Spectral symmetry in conference matrices, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, On symmetric BIBDs with the same 3-concurrence, Explicit Concentrators from Generalized N-Gons, 2-designs having an intersection number \(k-n\), Theorems on partitioned matrices revisited and their applications to graph spectra, Bounds for Aα-eigenvalues, Threshold functions for incidence properties in finite vector spaces, Eigenvalues of complete multipartite graphs, On the uniqueness of embedding a residual design, Rational G-matrices with rational eigenvalues, Derived eigenvalues of symmetric matrices, with applications to distance geometry, Homomorphisms of strongly regular graphs, On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound, Tightness in subset bounds for coherent configurations, Eigenvalues of a class of \((0,\pm{} 1)\) symmetric matrices, Reconstructing a generalized quadrangle from the Penttila-Williford 4-class association scheme, Partially metric association schemes with a multiplicity three, Distance Laplacian eigenvalues and chromatic number in graphs, Eigenvalues of finite graphs, Table of large \(({\Delta{}}, D)\)-graphs, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, Reconstructing a generalized quadrangle from its distance two association scheme, Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph, Graphs and Hermitian matrices: eigenvalue interlacing, Upper bounds on the size of transitive subtournaments in digraphs, The spread of the spectrum of a graph, The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\), Eigenvalues and chromatic number of a signed graph, Analysis and design of a fault-tolerant tree architecture, New large graphs with given degree and diameter six, On \((v,k,\lambda{})\) graphs and designs with trivial automorphism group, Bounds on subsets of coherent configurations, Some sporadic geometries related to PG(3,2), Eigenvalue interlacing and weight parameters of graphs, Weighted graphs: Eigenvalues and chromatic number, Tactical decompositions of Steiner systems and orbits of projective groups, A new eigenvalue bound for independent sets, On some new 2-(56, 12, 3) designs