Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
From MaRDI portal
Publication:2528107
Cites work
- Graphs with Maximal Even Girth
- scientific article; zbMATH DE number 3145665 (Why is no real title available?)
- scientific article; zbMATH DE number 3152621 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3258082 (Why is no real title available?)
- scientific article; zbMATH DE number 3323785 (Why is no real title available?)
- scientific article; zbMATH DE number 3193312 (Why is no real title available?)
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- On the Uniqueness of the Triangular Association Scheme
- Orthogonal Matrices with Zero Diagonal
- Self-dual configurations and regular graphs
- Strongly regular graphs, partial geometries and partially balanced designs
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(96)- A class of distance-regular graphs that are \(\phi\)-polynomial
- A survey of some problems in combinatorial designs - a matrix approach
- The connectivity of strongly regular graphs
- Characterization of the association schemes of Hermitian forms over GF(2^ 2)
- 2-designs having an intersection number k-n
- Strongly regular graphs having strongly regular subconstituents
- 6-transitive graphs
- Quadriques partielles d'indice deux
- New combinatorial characterizations of generalized quadrangles
- Rational G-matrices with rational eigenvalues
- 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 rank 3 permutation groups
- The regular two-graph on 276 vertices
- Strongly regular graphs
- 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
- Strongly regular graphs with smallest eigenvalue -m
- On a class of graphs without 3-stars
- A characterization of triangular and lattice graphs
- Near polygons and Fischer spaces
- On splitting the Clebsch graph
- Determination of the distance-regular graphs without 3-claws
- On three-dimensional Schur rings obtained from partial spreads
- Coedge regular graphs without 3-stars
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Which graphs are determined by their spectrum?
- Balancedly splittable Hadamard matrices
- A valency bound for distance-regular graphs
- The Hermitian two-graph and its code
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- A geometric construction of partial geometries with a Hermitian point graph
- Valency of distance-regular antipodal graphs with diameter 4
- Johan Jacob Seidel
- Complex spherical codes with three inner products
- The cyclic edge-connectivity of strongly regular graphs
- Smooth cubic surfaces with 15 lines
- Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
- Eigenvalues of Cayley graphs
- On the monotonicity of the number of positive entries in nonnegative five-element matrix powers
- Conditions for the parameters of the block graph of quasi-symmetric designs
- On the integrability of strongly regular graphs
- On k-connected-homogeneous graphs
- Amply regular graphs with Hoffman's condition
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- On characterizing certain graphs with four eigenvalues by their spectra
- A generalization of the matrix equation A^ 2=J
- Intersection properties of finite sets
- Equiangular lines
- Disconnecting strongly regular graphs
- Designs associated with maximum independent sets of a graph
- Maximizing the order of a regular graph of given valency and second eigenvalue
- Biregular graphs with three eigenvalues
- Column-wise extendible vector expressions and the relational computation of sets of sets
- A note on graphs with exactly two main eigenvalues
- Lattices of Simplex Type
- On quasi-strongly regular graphs
- Independent protection in graphs
- Exceptional graphs with smallest eigenvalue -2 and related problems
- The extendability of matchings in strongly regular graphs
- scientific article; zbMATH DE number 1341365 (Why is no real title available?)
- Two are better than one: fundamental parameters of frame coherence
- 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
- Fiedler vectors with unbalanced sign patterns
- The generalized distance spectrum of a graph and applications
- Certain 3-decompositions of complete graphs, with an application to finite fields
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- Universal adjacency matrices with two eigenvalues
- Random strongly regular graphs?
- Characterizations of certain classes of graphs
- On classification of two class partially balanced designs
- Some relations between energy and Seidel energy of a graph
- Uniform scrambles on graphs
- Graphs with two main and two plain eigenvalues
- On regular graphs equienergetic with their complements
- Genuinely nonabelian partial difference sets
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- (0,)-graphs and n-cubes
- Uniform extensions of partial geometries
- Strongly regular graphs with Hoffman's condition
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Rank three permutation groups with rank three subconstituents
- Designs over regular graphs with least eigenvalue \(-2\)
- 5-chromatic strongly regular graphs
- Delsarte clique graphs
- Linear programming bounds for regular graphs
- Small extended generalized quadrangles
- Strongly regular graphs with maximal energy
- Equiangular tight frames from complex Seidel matrices containing cube roots of unity
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)