Combinatorial approach for computing the characteristic polynomial of a matrix
From MaRDI portal
Publication:710864
DOI10.1016/j.laa.2010.05.010zbMath1211.05069OpenAlexW2093322595MaRDI QIDQ710864
Francesco Belardo, Enzo M. Li Marzi, Slobodan K. Simic
Publication date: 22 October 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.05.010
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)
Related Items
Polynomial reconstruction of signed graphs ⋮ On Quipus whose signless Laplacian index does not exceed 4.5 ⋮ Perturbations in a signed graph and its index ⋮ A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients ⋮ On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter ⋮ Some α -spectral extremal results for some digraphs ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Limit points for the spectral radii of signed graphs ⋮ On the relationship between shortlex order and \(A_\alpha \)-spectral radii of graphs with starlike branch tree ⋮ Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices ⋮ Connected signed graphs of fixed order, size, and number of negative edges with maximal index ⋮ Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value ⋮ Unnamed Item ⋮ Locating eigenvalues of unbalanced unicyclic signed graphs ⋮ On the index of unbalanced signed bicyclic graphs ⋮ On the spectral invariants of symmetric matrices with applications in the spectral graph theory ⋮ On signed graphs whose second largest Laplacian eigenvalue does not exceed 3 ⋮ On the largest eigenvalue of signed unicyclic graphs ⋮ Open problems in the spectral theory of signed graphs ⋮ Mixed paths and cycles determined by their spectrum ⋮ Fast algorithms for computing the characteristic polynomial of threshold and chain graphs ⋮ Maximizing the largest eigenvalues of signed unicyclic graphs ⋮ Spectral characterizations of signed lollipop graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectral radius of weighted trees with fixed diameter and weight set
- Parallel concepts in graph theory
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH
- Schwenk-Like Formulas for Weighted Digraphs
This page was built for publication: Combinatorial approach for computing the characteristic polynomial of a matrix
