A study of eigenspaces of graphs
The relationship between the structure of a graph and its eigenspaces is investigated. Most emphasis is given to the angles between the eigenspaces and the vectors of the standard basis in \(\mathbb{R}^ n\). It is shown that for any given graph one can define particular bases of its eigenspaces, called canonical bases, in such a way that two graphs are isomorphic if and only if they have the same spectrum and the same canonical bases. Unfortunately, it is not clear if one can use these results to devise an efficient algorithm for isomorphism checking. It is also not clear to what extent these results are related to the polynomial time algorithm for isomorphisms of graphs with bounded eigenvalue multiplicities of Babai, Grigorjev, and Mount.
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- Constructing trees with given eigenvalues and angles
- Developments in the theory of graph spectra
- scientific article; zbMATH DE number 4174971 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4198034 (Why is no real title available?)
- scientific article; zbMATH DE number 4198035 (Why is no real title available?)
- scientific article; zbMATH DE number 4135984 (Why is no real title available?)
- scientific article; zbMATH DE number 4139784 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 17788 (Why is no real title available?)
- scientific article; zbMATH DE number 32145 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 3497926 (Why is no real title available?)
- scientific article; zbMATH DE number 3606506 (Why is no real title available?)
- Recent results in the theory of graph spectra
- The graph isomorphism disease
- The second largest eigenvalue of a tree
- On certain eigenspaces of cographs
- Graph algebras and the graph isomorphism problem
- Star partitions and regularity in graphs
- On some algorithmic investigations of star partitions of graphs
- Identification of irreducible components of canonical graphs
- The characteristic polynomials of modified graphs
- Strongly connected simply laced quivers and their eigenvectors.
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- A note on the multiplicities of graph eigenvalues
- Line star sets for Laplacian eigenvalues
- Eigenspaces of graphs
- The real symmetric matrices of odd order with a P-set of maximum size.
- scientific article; zbMATH DE number 5901910 (Why is no real title available?)
- scientific article; zbMATH DE number 32145 (Why is no real title available?)
- scientific article; zbMATH DE number 193703 (Why is no real title available?)
- scientific article; zbMATH DE number 1484336 (Why is no real title available?)
- scientific article; zbMATH DE number 1539536 (Why is no real title available?)
- Graph cospectrality using neighborhood matrices
- On testing isomorphism of graphs of bounded eigenvalue multiplicity
- Star partitions and the graph isomorphism problem
- scientific article; zbMATH DE number 910921 (Why is no real title available?)
- Graphs with least eigenvalue -2: The star complement technique
- Graphs for small multiprocessor interconnection networks
- Partition coefficients of acyclic graphs
- Multiplicity of graph Hermitian eigenvalues
- On a hierarchy of spectral isomorphism invariants
- On a hierarchy of spectral invariants for graphs
- Employing star complements in search for graphs with fixed rank
- Drawing graphs by eigenvectors: theory and practice
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
- On graphs whose star sets are (co-)cliques
- On the power of combinatorial and spectral invariants
This page was built for publication: A study of eigenspaces of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365658)
