Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
From MaRDI portal
Publication:2528107
DOI10.1016/0024-3795(68)90008-6zbMath0159.25403OpenAlexW2035098448WikidataQ56209826 ScholiaQ56209826MaRDI QIDQ2528107
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 approach ⋮ Near polygons and Fischer spaces ⋮ The generalized distance spectrum of a graph and applications ⋮ Designs over regular graphs with least eigenvalue \(-2\) ⋮ Distance-regular Cayley graphs with least eigenvalue \(-2\) ⋮ Biregular graphs with three eigenvalues ⋮ The connectivity of strongly regular graphs ⋮ Balancedly splittable Hadamard matrices ⋮ Eigenvalues of Cayley graphs ⋮ On splitting the Clebsch graph ⋮ Disconnecting strongly regular graphs ⋮ Designs associated with maximum independent sets of a graph ⋮ Johan Jacob Seidel ⋮ Determination of the distance-regular graphs without 3-claws ⋮ A note on graphs with exactly two main eigenvalues ⋮ 5-chromatic strongly regular graphs ⋮ Delsarte clique graphs ⋮ On three-dimensional Schur rings obtained from partial spreads ⋮ Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\) ⋮ Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Coedge regular graphs without 3-stars ⋮ 2-designs having an intersection number \(k-n\) ⋮ Independent protection in graphs ⋮ Some relations between energy and Seidel energy of a graph ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ The extendability of matchings in strongly regular graphs ⋮ A valency bound for distance-regular graphs ⋮ Linear programming bounds for regular graphs ⋮ Strongly regular graphs having strongly regular subconstituents ⋮ Graphs with two main and two plain eigenvalues ⋮ 6-transitive graphs ⋮ On regular graphs equienergetic with their complements ⋮ Two are better than one: fundamental parameters of frame coherence ⋮ 1-homogeneous graphs with cocktail party \({\mu}\)-graphs ⋮ Quadriques partielles d'indice deux ⋮ Which graphs are determined by their spectrum? ⋮ New combinatorial characterizations of generalized quadrangles ⋮ Unnamed Item ⋮ Rational G-matrices with rational eigenvalues ⋮ Small extended generalized quadrangles ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ Strictly Deza line graphs ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ Regular 2-graphs and extensions of partial geometries ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Truncated \(D_ n\) Coxeter complexes as extended partial geometries with maximum diameter ⋮ On the monotonicity of the number of positive entries in nonnegative five-element matrix powers ⋮ Strongly regular graphs with maximal energy ⋮ Complex spherical codes with three inner products ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Equiangular tight frames from complex Seidel matrices containing cube roots of unity ⋮ Lattices of Simplex Type ⋮ The cyclic edge-connectivity of strongly regular graphs ⋮ Conditions for the parameters of the block graph of quasi-symmetric designs ⋮ Unnamed Item ⋮ On classification of two class partially balanced designs ⋮ On rank 3 permutation groups ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ Universal adjacency matrices with two eigenvalues ⋮ The regular two-graph on 276 vertices ⋮ Strongly regular graphs ⋮ Random strongly regular graphs? ⋮ Certain 3-decompositions of complete graphs, with an application to finite fields ⋮ Line graphs, root systems, and elliptic geometry ⋮ Partial geometries in finite affine spaces ⋮ The factors of a design matrix ⋮ Combinatorial characterizations of generalized quadrangles with parameters \(s=q\) and \(t=q^2\) ⋮ Characterizations of regular magic graphs ⋮ On the integrability of strongly regular graphs ⋮ Strongly regular graphs with smallest eigenvalue -m ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue ⋮ On \(k\)-connected-homogeneous graphs ⋮ \((0,\lambda)\)-graphs and \(n\)-cubes ⋮ Unnamed Item ⋮ Characterizations of certain classes of graphs ⋮ On characterizing certain graphs with four eigenvalues by their spectra ⋮ A generalization of the matrix equation \(A^ 2=J\) ⋮ Uniform extensions of partial geometries ⋮ Strongly regular graphs with Hoffman's condition ⋮ On a class of graphs without 3-stars ⋮ On a conjecture of Brouwer involving the connectivity of strongly regular graphs ⋮ Intersection properties of finite sets ⋮ Equiangular lines ⋮ A characterization of triangular and lattice graphs ⋮ On quasi-strongly regular graphs ⋮ Rank three permutation groups with rank three subconstituents ⋮ Smooth cubic surfaces with 15 lines ⋮ The Hermitian two-graph and its code ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Fiedler vectors with unbalanced sign patterns ⋮ Amply regular graphs with Hoffman's condition ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial ⋮ A geometric construction of partial geometries with a Hermitian point graph ⋮ Valency of distance-regular antipodal graphs with diameter 4 ⋮ Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
Cites Work
- Strongly regular graphs, partial geometries and partially balanced designs
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- On the Uniqueness of the Triangular Association Scheme
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Orthogonal Matrices with Zero Diagonal
- Graphs with Maximal Even Girth
- Self-dual configurations and regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
