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