scientific article
From MaRDI portal
Publication:3262641
zbMath0089.15102MaRDI QIDQ3262641
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
Notes on simplicial rook graphs ⋮ Quasi-symmetric designs related to the triangular graph ⋮ Designs associated with maximum independent sets of a graph ⋮ Association schemes on 28 points as mergings of a half-homogeneous coherent configuration ⋮ A Note on Order and Eigenvalue Multiplicity of Strongly Regular Graphs ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Graphs Identified by Logics with Counting ⋮ Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ Cospectral mates for the union of some classes in the Johnson association scheme ⋮ Cospectral mates for generalized Johnson and Grassmann graphs ⋮ Uniqueness of an association scheme related to the Witt design on 11 points ⋮ Permanental polynomials of graphs ⋮ On the Line Graph of a Projective Plane ⋮ On classification of two class partially balanced designs ⋮ Strongly regular graphs ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ A spectral characterization of the \(s\)-clique extension of the triangular graphs ⋮ Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 ⋮ Graphes liés aux espaces polaires ⋮ Root systems and the Johnson and Hamming graphs ⋮ The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) ⋮ Characterization of families of rank 3 permutation groups by the subdegrees. I ⋮ On the uniqueness of the graphs G(n,k) of the Johnson schemes ⋮ On graphs with three eigenvalues ⋮ Embedding the complement of an oval in a projective plane of even order ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem ⋮ On partial geometries arising from maximal arcs ⋮ The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
This page was built for publication:
