Line graphs, root systems, and elliptic geometry
From MaRDI portal
Cites work
- A characterization of the Mathieu group \(M_{11}\)
- A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
- Characterization of line graphs
- Characterizations of certain classes of graphs
- Equiangular lines
- scientific article; zbMATH DE number 3152621 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- scientific article; zbMATH DE number 3503264 (Why is no real title available?)
- scientific article; zbMATH DE number 3556150 (Why is no real title available?)
- scientific article; zbMATH DE number 3428979 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3392741 (Why is no real title available?)
- scientific article; zbMATH DE number 3407710 (Why is no real title available?)
- On characterizing certain graphs with four eigenvalues by their spectra
- On graphs whose least eigenvalue exceeds -1-2
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- On the Polynomial of a Graph
- Orbits under actions of affine groups over GF(2)
- Spektren endlicher Grafen
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(only showing first 100 items - show all)- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Root systems and optimal block designs
- On affine orbifold nets associated with outer automorphisms
- 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-2
- 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
- A generalization of a theorem of Hoffman
- On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- 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\)
- Baskets and fibred links realizing \(A_n\)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- The enumeration of spanning tree of weighted graphs
- Regular character-graphs whose eigenvalues are greater than or equal to -2
- Maximal digraphs whose Hermitian spectral radius is at most 2
- Cutoff on graphs and the Sarnak-Xue density of eigenvalues
- Subgroup sum graphs of finite abelian groups
- On tetrahedrally closed line systems and a generalization of the Haemers-Roos inequality
- A classification of small operators using graph theory
- Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics
- Biangular lines revisited
- Graph representations, two-distance sets, and equiangular lines
- Spectra of signed graphs with two eigenvalues
- On the integrability of strongly regular graphs
- Geometric antipodal distance-regular graphs with a given smallest eigenvalue
- Distance-regular graphs without 4-claws
- A note on the E-optimality of regular line graph designs
- From finite line graphs to infinite derived signed graphs
- Uniquely derived generalized line graphs and uniquely represented signed graphs with least eigenvalues \(\geq -2\)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Irreducible circuits and Coxeter arrangements
- Universal completability, least eigenvalue frameworks, and vector colorings
- The signature of two generalizations of line graphs
- Some notes on tetrahedrally closed spherical sets in Euclidean spaces
- The line graphs of lollipop graphs are determined by their spectra
- 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
- Quadratic embedding constants of graph joins
- Graphs with second largest eigenvalue less than 1/2
- Maximizing the order of a regular graph of given valency and second eigenvalue
- A classification of all 1-Salem graphs
- Spectral characterization of line graphs of starlike trees
- Equivalence of four descriptions of generalized line graphs
- Lattices of Simplex Type
- Normalizer of parabolic aubgroups in unitary reflection groups
- A METHOD OF CLASSIFYING ALL SIMPLY LACED ROOT SYSTEMS
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Fat Hoffman graphs with smallest eigenvalue greater than -3
- On the limit points of the smallest eigenvalues of regular graphs
- Cyclotomic matrices over real quadratic integer rings
- Explicit bounds from the Alon-Boppana theorem
- On the automorphism groups of strongly regular graphs. II.
- The largest eigenvalue of a graph: A survey
- Developments in the theory of graph spectra
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Metric Transforms and Euclidean Embeddings
- Geometric representations of graphs
- Geometric representations of graphs
- Graphs with least eigenvalue -2: ten years on
- Notes on exceptional signed graphs
- A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type \(\mathbb{A}_n\)
- Signed graphs with totally disconnected star complements
- Open problems in the spectral theory of signed graphs
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- EMBEDDINGS OF COMPLEX LINE SYSTEMS AND FINITE REFLECTION GROUPS
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- The non-bipartite integral graphs with spectral radius three
- A decomposition of signed graphs with two eigenvalues
- Binary contraction of graphs
This page was built for publication: Line graphs, root systems, and elliptic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229893)
