On spectral characterization and embeddings of graphs
From MaRDI portal
Publication:754883
Cites work
- scientific article; zbMATH DE number 3695248 (Why is no real title available?)
- scientific article; zbMATH DE number 3456979 (Why is no real title available?)
- scientific article; zbMATH DE number 3608081 (Why is no real title available?)
- scientific article; zbMATH DE number 3268838 (Why is no real title available?)
- scientific article; zbMATH DE number 3379174 (Why is no real title available?)
- An interrelation between line graphs, eigenvalues, and matroids
- Characterizations of derived graphs
- Eigenvalues of a graph and its imbeddings
- Line graphs, root systems, and elliptic geometry
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- Orbits under actions of affine groups over GF(2)
- The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
Cited in
(37)- Optimality and construction of some rectangular designs
- Graphs with least eigenvalue \(-2\): ten years on
- On the smallest eigenvalues of the line graphs of some trees
- On the optimality of block designs
- Infinite graphs with the least limiting eigenvalue greater than -2
- The maximal exceptional graphs
- Regular graphs with four eigenvalues
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- A note on the E-optimality of regular line graph designs
- The kite graph is determined by its adjacency spectrum
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
- Graph properties for splitting with grounded Laplacian matrices
- The perturbed laplacian matrix of a graph
- Graph coloration and group theory for factorization of symmetric dynamic systems
- A table of connected graphs on six vertices
- On the algebraic connectivity of a double covering graph
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs
- On the maximum spread of planar and outerplanar graphs
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
- Graphs with least eigenvalue \(-2\): The star complement technique
- On the efficiency of regular generalized line graph designs
- Spectra, Euclidean representations and clusterings of hypergraphs
- On the spectral characterization of pineapple graphs
- The line graphs of lollipop graphs are determined by their spectra
- Star complements and exceptional graphs
- The limit points of eigenvalues of graphs
- A surprising property of the least eigenvalue of a graph
- Graph toughness from Laplacian eigenvalues
- Spectral characterization of line graphs of starlike trees
- Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics
- Developments in the theory of graph spectra
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Energy of strong reciprocal graphs
- Some optimal designs of block size two
- Baskets and fibred links realizing \(A_n\)
- Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
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)