Combinatorial approach for computing the characteristic polynomial of a matrix
From MaRDI portal
Recommendations
Cites work
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- An introduction to the theory of graph spectra
- COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On the spectral radius of weighted trees with fixed diameter and weight set
- Parallel concepts in graph theory
- Schwenk-like formulas for weighted digraphs
Cited in
(32)- Perturbations in a signed graph and its index
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients
- On graphs with exactly three Q-eigenvalues at least two
- On Quipus whose signless Laplacian index does not exceed 4.5
- A combinatorial method for computing characteristic polynomials of starlike hypergraphs
- Locating eigenvalues of unbalanced unicyclic signed graphs
- On the index of unbalanced signed bicyclic graphs
- On the largest eigenvalue of signed unicyclic graphs
- Mixed paths and cycles determined by their spectrum
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- Spectral characterizations of signed lollipop graphs
- Polynomial reconstruction of signed graphs
- On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem
- scientific article; zbMATH DE number 9717 (Why is no real title available?)
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- On the spectral invariants of symmetric matrices with applications in the spectral graph theory
- Open problems in the spectral theory of signed graphs
- scientific article; zbMATH DE number 6256206 (Why is no real title available?)
- On signed graphs whose second largest Laplacian eigenvalue does not exceed 3
- Schwenk-like formulas for weighted digraphs
- Maximizing the largest eigenvalues of signed unicyclic graphs
- On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter
- Some α -spectral extremal results for some digraphs
- Signed bicyclic graphs with minimal index
- Limit points for the spectral radii of signed graphs
- On the relationship between shortlex order and A_ -spectral radii of graphs with starlike branch tree
- Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
- Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value
- Computing the determinant of a signed graph
- On the least eigenvalues of unbalanced signed bicyclic graphs with given girth
- Which Laplacian cospectral graphs have the same degree sequences?
- Graphs whose spectral radius is bounded by a fixed Hoffman-Smith limit point
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)
