Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

From MaRDI portal
Revision as of 04:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2528107

DOI10.1016/0024-3795(68)90008-6zbMath0159.25403OpenAlexW2035098448WikidataQ56209826 ScholiaQ56209826MaRDI QIDQ2528107

J. J. Seidel

Publication date: 1968

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(68)90008-6




Related Items (95)

A survey of some problems in combinatorial designs - a matrix approachNear polygons and Fischer spacesThe generalized distance spectrum of a graph and applicationsDesigns over regular graphs with least eigenvalue \(-2\)Distance-regular Cayley graphs with least eigenvalue \(-2\)Biregular graphs with three eigenvaluesThe connectivity of strongly regular graphsBalancedly splittable Hadamard matricesEigenvalues of Cayley graphsOn splitting the Clebsch graphDisconnecting strongly regular graphsDesigns associated with maximum independent sets of a graphJohan Jacob SeidelDetermination of the distance-regular graphs without 3-clawsA note on graphs with exactly two main eigenvalues5-chromatic strongly regular graphsDelsarte clique graphsOn three-dimensional Schur rings obtained from partial spreadsCharacterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of SetsCoedge regular graphs without 3-stars2-designs having an intersection number \(k-n\)Independent protection in graphsSome relations between energy and Seidel energy of a graphExceptional graphs with smallest eigenvalue -2 and related problemsThe extendability of matchings in strongly regular graphsA valency bound for distance-regular graphsLinear programming bounds for regular graphsStrongly regular graphs having strongly regular subconstituentsGraphs with two main and two plain eigenvalues6-transitive graphsOn regular graphs equienergetic with their complementsTwo are better than one: fundamental parameters of frame coherence1-homogeneous graphs with cocktail party \({\mu}\)-graphsQuadriques partielles d'indice deuxWhich graphs are determined by their spectrum?New combinatorial characterizations of generalized quadranglesUnnamed ItemRational G-matrices with rational eigenvaluesSmall extended generalized quadranglesOn the automorphism groups of strongly regular graphs. II.Strictly Deza line graphsThe Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphsRegular 2-graphs and extensions of partial geometriesThe symbiotic relationship of combinatorics and matrix theoryTruncated \(D_ n\) Coxeter complexes as extended partial geometries with maximum diameterOn the monotonicity of the number of positive entries in nonnegative five-element matrix powersStrongly regular graphs with maximal energyComplex spherical codes with three inner productsGraphs with three eigenvalues and second largest eigenvalue at most 1Equiangular tight frames from complex Seidel matrices containing cube roots of unityLattices of Simplex TypeThe cyclic edge-connectivity of strongly regular graphsConditions for the parameters of the block graph of quasi-symmetric designsUnnamed ItemOn classification of two class partially balanced designsOn rank 3 permutation groupsThe distance-regular graphs such that all of its second largest local eigenvalues are at most oneUniversal adjacency matrices with two eigenvaluesThe regular two-graph on 276 verticesStrongly regular graphsRandom strongly regular graphs?Certain 3-decompositions of complete graphs, with an application to finite fieldsLine graphs, root systems, and elliptic geometryPartial geometries in finite affine spacesThe factors of a design matrixCombinatorial characterizations of generalized quadrangles with parameters \(s=q\) and \(t=q^2\)Characterizations of regular magic graphsOn the integrability of strongly regular graphsStrongly regular graphs with smallest eigenvalue -mMaximizing the Order of a Regular Graph of Given Valency and Second EigenvalueOn \(k\)-connected-homogeneous graphs\((0,\lambda)\)-graphs and \(n\)-cubesUnnamed ItemCharacterizations of certain classes of graphsOn characterizing certain graphs with four eigenvalues by their spectraA generalization of the matrix equation \(A^ 2=J\)Uniform extensions of partial geometriesStrongly regular graphs with Hoffman's conditionOn a class of graphs without 3-starsOn a conjecture of Brouwer involving the connectivity of strongly regular graphsIntersection properties of finite setsEquiangular linesA characterization of triangular and lattice graphsOn quasi-strongly regular graphsRank three permutation groups with rank three subconstituentsSmooth cubic surfaces with 15 linesThe Hermitian two-graph and its codeGraphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphsFiedler vectors with unbalanced sign patternsAmply regular graphs with Hoffman's conditionA class of distance-regular graphs that are \(\phi\)-polynomialA geometric construction of partial geometries with a Hermitian point graphValency of distance-regular antipodal graphs with diameter 4Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue




Cites Work




This page was built for publication: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3