Line graphs, root systems, and elliptic geometry

DOI10.1016/0021-8693(76)90162-9zbMath0337.05142MaRDI QIDQ1229893

J. J. Seidel, Peter J. Cameron, Ernest E. Shult, Jean-Marie Goethals

Publication date: 1976

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(76)90162-9

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

51M20: Polyhedra and polytopes; regular figures, division of spaces

20H15: Other geometric groups, including crystallographic groups

05C99: Graph theory

Related Items

The largest eigenvalue of a graph: A survey, Developments in the theory of graph spectra, Geometric representations of graphs, Geometric representations of graphs, Metric Transforms and Euclidean Embeddings, Graphs with least eigenvalue \(-2\): The star complement technique, Binary contraction of graphs, On spectral characterization and embeddings of graphs, Discrete hyperbolic geometry, Lower bounds on the spectra of symmetric matrices with nonnegative entries, The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\), On the optimality of block designs, A new feasibility condition for distance-regular graphs, On the efficiency of regular generalized line graph designs, Infinite graphs with the least limiting eigenvalue greater than -2, The classification of finite connected hypermetric spaces, Root system graphs, Signed graphs represented by \(D_{\infty}\), Multiplicative designs II. Uniform normal and related structures, Graphs with eigenvalues at least - 2, On norm three vectors in integral Euclidean lattices. I, A surprising property of the least eigenvalue of a graph, On neighbourhood line graphs, Once again on polyhedral groups and Dynkin graphs, Embedding edge-colored complete graphs in binary affine spaces, On graphs whose least eigenvalue exceeds \(-1-\sqrt2\), Nonregular graphs with three eigenvalues, Some optimal designs of block size two, Laplacian matrices of graphs: A survey, A note on unimodular congruence of graphs, Representation of signed graphs by root system \(E_ 8\), Coxeter-Dynkin diagrams of partially ordered sets and A'Campo-Gusein-Zade diagrams of simple singularities, The maximal exceptional graphs, Which graphs are determined by their spectrum?, On graphs with three eigenvalues, Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem, A characterization of signed graphs represented by root system \(D_ \infty\), Root systems and the Johnson and Hamming graphs, Bipartite density of cubic graphs: The case of equality, Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs, Johan Jacob Seidel, On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\), Graph representations, two-distance sets, and equiangular lines, Irreducible circuits and Coxeter arrangements, On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\), On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\), Monotone maps, sphericity and bounded second eigenvalue, Lattices of Simplex Type, Normalizer of parabolic aubgroups in unitary reflection groups, Exceptional graphs with smallest eigenvalue -2 and related problems

Cites Work

• Spektren endlicher Grafen
• Orbits under actions of affine groups over GF(2)
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• A characterization of the Mathieu group \(M_{11}\)
• On characterizing certain graphs with four eigenvalues by their spectra
• Equiangular lines
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• On the Polynomial of a Graph
• On the Line Graph of a Symmetric Balanced Incomplete Block Design
• Characterization of line graphs
• Characterizations of certain classes of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item