The characteristic polynomial of a graph
From MaRDI portal
Cites work
- Cospectral Graphs and Digraphs
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3214389 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Spektren endlicher Grafen
- The Determinant of the Adjacency Matrix of a Graph
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(38)- A note on cospectral graphs
- Permanental polynomials of graphs
- Tree counting polynomials for labelled graphs. I: Properties
- On the distance matrix of a tree
- An introduction to matching polynomials
- Spectra of Cayley graphs
- Nonisomorphic trees with the same T-polynomial
- Distance matrix polynomials of trees
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
- Maximal determinants of combinatorial matrices
- Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
- Complementarity eigenvalue analysis of connected graphs
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Cospectral graphs and digraphs with given automorphism group
- Laplacian spectra and spanning trees of threshold graphs
- On conjectures of network distance measures by using graph spectra
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- On bipartite graphs having minimum fourth adjacency coefficient
- Spectra of weighted uniform hypertrees
- Novel results on partial Hosoya polynomials: an application in chemistry
- A large family of cospectral Cayley graphs over dicyclic groups
- Eigenvalues of a graph and its imbeddings
- On roots of Wiener polynomials of trees
- The spectra of uniform hypertrees
- A note on non-isomorphic cospectral digraphs
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Growth rates of geometric grid classes of permutations
- A large family of cospectral Cayley graphs over dihedral groups
- Complementarity eigenvalues and graph determination
- Spectral radii of friendship graphs and their connected induced subgraphs
- On 4-Sachs optimal graphs
- On the coefficients of skew Laplacian characteristic polynomial of digraphs
- A unified criterion for distinguishing graphs by their spectral radius
- A hypergraph Heilmann-Lieb theorem
- Spectra, Euclidean representations and clusterings of hypergraphs
- Combinatorial explanation of coefficients of the signless Laplacian characteristic polynomial of a digraph
- On the roots of Wiener polynomials of graphs
- Spectra of digraphs
This page was built for publication: The characteristic polynomial of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544589)
