Combinatorial approach for computing the characteristic polynomial of a matrix
DOI10.1016/J.LAA.2010.05.010zbMATH Open1211.05069OpenAlexW2093322595MaRDI QIDQ710864FDOQ710864
Slobodan K. Simić, Francesco Belardo, Enzo M. Li Marzi
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)
Cites Work
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Title not available (Why is that?)
- On the spectral radius of weighted trees with fixed diameter and weight set
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH
- Schwenk-Like Formulas for Weighted Digraphs
Cited In (26)
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Title not available (Why is that?)
- Title not available (Why is that?)
- Open problems in the spectral theory of signed graphs
- On the spectral invariants of symmetric matrices with applications in the spectral graph theory
- Polynomial reconstruction of signed graphs
- Locating eigenvalues of unbalanced unicyclic signed graphs
- On signed graphs whose second largest Laplacian eigenvalue does not exceed 3
- On the index of unbalanced signed bicyclic graphs
- On the largest eigenvalue of signed unicyclic graphs
- Computing the determinant of a signed graph
- Mixed paths and cycles determined by their spectrum
- On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter
- On graphs with exactly three \(Q\)-eigenvalues at least two
- On Quipus whose signless Laplacian index does not exceed 4.5
- Some α -spectral extremal results for some digraphs
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- 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
- On the least eigenvalues of unbalanced signed bicyclic graphs with given girth
- Spectral characterizations of signed lollipop graphs
- Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value
- Perturbations in a signed graph and its index
- Maximizing the largest eigenvalues of signed unicyclic graphs
This page was built for publication: Combinatorial approach for computing the characteristic polynomial of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710864)
