scientific article
From MaRDI portal
Publication:3866127
zbMath0429.05012MaRDI QIDQ3866127
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
eigenvaluesHermitian matrixblock designparameters of graphsstronglysubdesignsinterlacedmaximal cocliquepartitioned into blocks
Combinatorial aspects of block designs (05B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (34)
On almost nexus semi-symmetric designs ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On 3-chromatic distance-regular graphs ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ Spectral Bounds for the k-Regular Induced Subgraph Problem ⋮ 5-chromatic strongly regular graphs ⋮ Extremal generalized hexagons and triple intersection numbers ⋮ Intriguing sets of vertices of regular graphs ⋮ Large cuts with local algorithms on triangle-free graphs ⋮ Tight sets of points in the half-spin geometry related to \(Q^{+}(9, q)\) ⋮ New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix ⋮ Two conjectured strengthenings of Turán's theorem ⋮ Explicit non-malleable codes from bipartite graphs ⋮ An inequality for generalized hexagons ⋮ Generalized quadrangles and the Higman-Sims technique ⋮ Spectral lower bounds for the quantum chromatic number of a graph. II ⋮ Some new strongly regular graphs ⋮ Unnamed Item ⋮ Spreads in strongly regular graphs ⋮ On quasi-symmetric designs ⋮ A generalization of the Haemers-Mathon bound for near hexagons ⋮ On regular induced subgraphs of generalized polygons ⋮ The \(k\)-regular induced subgraph problem ⋮ Complementary total domination in graphs ⋮ Graph homomorphisms through random walks ⋮ Regular partitions of (weak) finite generalized polygons ⋮ On the displacement of eigenvalues when removing a twin vertex ⋮ The chromatic index of strongly regular graphs ⋮ A Proof of Brouwer's Toughness Conjecture ⋮ Products of Differences over Arbitrary Finite Fields ⋮ Eigenvalues and edge-connectivity of regular graphs ⋮ Bounds for regular induced subgraphs of strongly regular graphs ⋮ Tight distance-regular graphs ⋮ A combinatorial characterization of extremal generalized hexagons
This page was built for publication:
