On spectral characterization and embeddings of graphs
From MaRDI portal
Publication:754883
DOI10.1016/0024-3795(79)90028-4zbMath0417.05025OpenAlexW1963843244MaRDI QIDQ754883
Michael Doob, Dragos Cvetković
Publication date: 1979
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(79)90028-4
eigenvalueembedding problemsadjacency matrix of a graphgeneralized line graphembeddings of graphsspectral characterizations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)
Related Items (36)
On the efficiency of regular generalized line graph designs ⋮ Infinite graphs with the least limiting eigenvalue greater than -2 ⋮ On the spectral characterization of pineapple graphs ⋮ Regular graphs with four eigenvalues ⋮ Graph coloration and group theory for factorization of symmetric dynamic systems ⋮ The limit points of eigenvalues of graphs ⋮ Star complements and exceptional graphs ⋮ Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics ⋮ Fat Hoffman graphs with smallest eigenvalue greater than \(-3\) ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ The maximal exceptional graphs ⋮ The line graphs of lollipop graphs are determined by their spectra ⋮ Graph toughness from Laplacian eigenvalues ⋮ A surprising property of the least eigenvalue of a graph ⋮ On the smallest eigenvalues of the line graphs of some trees ⋮ Edge-signed graphs with smallest eigenvalue greater than \(-2\) ⋮ On the algebraic connectivity of a double covering graph ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Unnamed Item ⋮ Spectra, Euclidean representations and clusterings of hypergraphs ⋮ Baskets and fibred links realizing \(A_n\) ⋮ The perturbed laplacian matrix of a graph ⋮ Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem ⋮ Graphs with least eigenvalue \(-2\): The star complement technique ⋮ Developments in the theory of graph spectra ⋮ A note on the E-optimality of regular line graph designs ⋮ The kite graph is determined by its adjacency spectrum ⋮ Spectral characterization of line graphs of starlike trees ⋮ A table of connected graphs on six vertices ⋮ Regular character-graphs whose eigenvalues are greater than or equal to \(-2\) ⋮ Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs ⋮ Some optimal designs of block size two ⋮ Graph properties for splitting with grounded Laplacian matrices ⋮ Lower bounds on the spectra of symmetric matrices with nonnegative entries ⋮ On the optimality of block designs ⋮ Optimality and construction of some rectangular designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbits under actions of affine groups over GF(2)
- Line graphs, root systems, and elliptic geometry
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- Eigenvalues of a graph and its imbeddings
- An interrelation between line graphs, eigenvalues, and matroids
- The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
- Characterizations of derived graphs
This page was built for publication: On spectral characterization and embeddings of graphs
