On spectral characterization and embeddings of graphs

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Cites Work

Characterizations of derived graphs
On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
Title not available (Why is that?)
An interrelation between line graphs, eigenvalues, and matroids
Title not available (Why is that?)
Line graphs, root systems, and elliptic geometry
Title not available (Why is that?)
Title not available (Why is that?)
The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
Eigenvalues of a graph and its imbeddings
Orbits under actions of affine groups over GF(2)
Title not available (Why is that?)

Cited In (37)

Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
Spectra, Euclidean representations and clusterings of hypergraphs
Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics
Graph toughness from Laplacian eigenvalues
Baskets and fibred links realizing \(A_n\)
A surprising property of the least eigenvalue of a graph
The kite graph is determined by its adjacency spectrum
On the efficiency of regular generalized line graph designs
Title not available (Why is that?)
The limit points of eigenvalues of graphs
Some optimal designs of block size two
The maximal exceptional graphs
Exceptional graphs with smallest eigenvalue -2 and related problems
Edge-signed graphs with smallest eigenvalue greater than \(-2\)
Graph coloration and group theory for factorization of symmetric dynamic systems
On the spectral characterization of pineapple graphs
The perturbed laplacian matrix of a graph
A table of connected graphs on six vertices
Graphs with least eigenvalue \(-2\): The star complement technique
On the maximum spread of planar and outerplanar graphs
The line graphs of lollipop graphs are determined by their spectra
Lower bounds on the spectra of symmetric matrices with nonnegative entries
On the smallest eigenvalues of the line graphs of some trees
On the optimality of block designs
Spectral characterization of line graphs of starlike trees
Graph properties for splitting with grounded Laplacian matrices
Graphs with least eigenvalue \(-2\): ten years on
Optimality and construction of some rectangular designs
Developments in the theory of graph spectra
Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
Star complements and exceptional graphs
Infinite graphs with the least limiting eigenvalue greater than -2
A note on the E-optimality of regular line graph designs
Regular graphs with four eigenvalues
Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
On the algebraic connectivity of a double covering graph

This page was built for publication: On spectral characterization and embeddings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754883)