Pages that link to "Item:Q2528107"

The following pages link to Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 (Q2528107):

Displayed 50 items.

• Biregular graphs with three eigenvalues (Q281935) ‎ (← links)
• A note on graphs with exactly two main eigenvalues (Q331176) ‎ (← links)
• Independent protection in graphs (Q400447) ‎ (← links)
• The extendability of matchings in strongly regular graphs (Q405235) ‎ (← links)
• Two are better than one: fundamental parameters of frame coherence (Q427070) ‎ (← links)
• On the automorphism groups of strongly regular graphs. II. (Q468725) ‎ (← links)
• Strictly Deza line graphs (Q470999) ‎ (← links)
• The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs (Q472425) ‎ (← links)
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one (Q550631) ‎ (← links)
• Universal adjacency matrices with two eigenvalues (Q550632) ‎ (← links)
• Graphs with three eigenvalues and second largest eigenvalue at most 1 (Q684121) ‎ (← links)
• \((0,\lambda)\)-graphs and \(n\)-cubes (Q755594) ‎ (← links)
• Uniform extensions of partial geometries (Q764692) ‎ (← links)
• Strongly regular graphs with Hoffman's condition (Q764822) ‎ (← links)
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs (Q765871) ‎ (← links)
• Rank three permutation groups with rank three subconstituents (Q797675) ‎ (← links)
• Designs over regular graphs with least eigenvalue \(-2\) (Q825523) ‎ (← links)
• 5-chromatic strongly regular graphs (Q856856) ‎ (← links)
• Delsarte clique graphs (Q866506) ‎ (← links)
• Linear programming bounds for regular graphs (Q897255) ‎ (← links)
• Small extended generalized quadrangles (Q921582) ‎ (← links)
• Strongly regular graphs with maximal energy (Q952063) ‎ (← links)
• Equiangular tight frames from complex Seidel matrices containing cube roots of unity (Q958032) ‎ (← links)
• A class of distance-regular graphs that are \(\phi\)-polynomial (Q1066908) ‎ (← links)
• A survey of some problems in combinatorial designs - a matrix approach (Q1076673) ‎ (← links)
• The connectivity of strongly regular graphs (Q1085180) ‎ (← links)
• Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\) (Q1122582) ‎ (← links)
• 2-designs having an intersection number \(k-n\) (Q1135286) ‎ (← links)
• Strongly regular graphs having strongly regular subconstituents (Q1144588) ‎ (← links)
• 6-transitive graphs (Q1147720) ‎ (← links)
• Quadriques partielles d'indice deux (Q1156356) ‎ (← links)
• New combinatorial characterizations of generalized quadrangles (Q1161747) ‎ (← links)
• Rational G-matrices with rational eigenvalues (Q1164060) ‎ (← links)
• Regular 2-graphs and extensions of partial geometries (Q1174155) ‎ (← links)
• The symbiotic relationship of combinatorics and matrix theory (Q1183182) ‎ (← links)
• Truncated \(D_ n\) Coxeter complexes as extended partial geometries with maximum diameter (Q1184575) ‎ (← links)
• On rank 3 permutation groups (Q1213951) ‎ (← links)
• The regular two-graph on 276 vertices (Q1219301) ‎ (← links)
• Strongly regular graphs (Q1219303) ‎ (← links)
• Line graphs, root systems, and elliptic geometry (Q1229893) ‎ (← links)
• Partial geometries in finite affine spaces (Q1235398) ‎ (← links)
• The factors of a design matrix (Q1236120) ‎ (← links)
• Combinatorial characterizations of generalized quadrangles with parameters \(s=q\) and \(t=q^2\) (Q1247329) ‎ (← links)
• Characterizations of regular magic graphs (Q1248530) ‎ (← links)
• Strongly regular graphs with smallest eigenvalue -m (Q1257906) ‎ (← links)
• On a class of graphs without 3-stars (Q1280687) ‎ (← links)
• A characterization of triangular and lattice graphs (Q1288230) ‎ (← links)
• Near polygons and Fischer spaces (Q1326546) ‎ (← links)
• On splitting the Clebsch graph (Q1344159) ‎ (← links)
• Determination of the distance-regular graphs without 3-claws (Q1356547) ‎ (← links)