scientific article; zbMATH DE number 1054726
From MaRDI portal
Publication:4352271
This paper is a nice survey of results about properties of automorphisms of a graph which can be deduced from its eigenvalues and eigenvectors. The main tools are convex polytopes and various matrix algebras associated to the adjacency matrix of the graph. For the entire collection see [Zbl 0868.00039].
Recommendations
Cited in
(25)- Matchings in regular graphs from eigenvalues
- Shifts in Cayley graphs
- Low-degree factors of random polynomials
- Graph Laplacians, nodal domains, and hyperplane arrangements
- On the expressive power of linear algebra on graphs
- Characterizing and computing weight-equitable partitions of graphs
- Eigenvalues of Cayley graphs
- Graph isomorphism, color refinement, and compactness
- Invariant subspace, determinant and characteristic polynomials
- Characteristic polynomials of digraphs having a semi-free action
- A comprehensive analysis of polyhedral lift-and-project methods
- Main eigenvalues and automorphisms of a graph
- Equitable decompositions of graphs with symmetries
- Trace, Symmetry and Orthogonality
- Estimation of means in graphical Gaussian models with symmetries
- Graph partitions and cluster synchronization in networks of oscillators
- scientific article; zbMATH DE number 1385144 (Why is no real title available?)
- Eigenvectors from eigenvalues: a survey of a basic identity in linear algebra
- Graphical designs and gale duality
- Communicability cosine distance: similarity and symmetry in graphs/networks
- Eigenpolytope Universality and Graphical Designs
- Simple eigenvalues of cubic vertex-transitive graphs
- Degree-similar graphs
- Symmetries of hypergraphs and some invariant subspaces of matrices associated with hypergraphs
- Homomorphisms, representations and characteristic polynomials of digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352271)
