Efficient computation of the characteristic polynomial of a threshold graph
From MaRDI portal
Publication:507427
DOI10.1016/j.tcs.2016.07.013zbMath1357.05062OpenAlexW1543974404MaRDI QIDQ507427
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.013
Related Items (4)
No threshold graphs are cospectral ⋮ The role of the anti-regular graph in the spectral analysis of threshold graphs ⋮ An explicit formula for the distance characteristic polynomial of threshold graphs ⋮ Delta invariant for Eulerian digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient computation of the characteristic polynomial of a tree and related tasks
- Matrix multiplication via arithmetic progressions
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- On certain eigenspaces of cographs
- On nested split graphs whose second largest eigenvalue is less than 1
- Computing the characteristic polynomial of a tree
- Fast algorithms for the characteristic polynomial
- On fast multiplication of polynomials over arbitrary algebras
- The rank of a cograph
- On the complexity of computing determinants
- Threshold graphs and related topics
- Eigenvalue location in threshold graphs
- On the adjacency matrix of a threshold graph
- Fast multiplication of large numbers
- Improved bound for complexity of matrix multiplication
- Modern Computer Algebra
- Computing the Characteristic Polynomial of Threshold Graphs
- Powers of tensors and fast matrix multiplication
- Faster Integer Multiplication
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- Reducing the adjacency matrix of a tree
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication: Efficient computation of the characteristic polynomial of a threshold graph
