An explicit formula for the distance characteristic polynomial of threshold graphs
From MaRDI portal
Publication:6159856
DOI10.1007/s40314-023-02350-6arXiv1811.03061OpenAlexW2899860932MaRDI QIDQ6159856
João Lazzarin, Oscar F. Márquez, Fernando Colman Tura
Publication date: 22 June 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03061
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectrum of threshold graphs
- Eigenvalues and energy in threshold graphs
- Efficient computation of the characteristic polynomial of a threshold graph
- Constructing cospectral graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- On nested split graphs whose second largest eigenvalue is less than 1
- No threshold graphs are cospectral
- On the distance spectra of threshold graphs
- Threshold graphs and related topics
- Distance spectra of graphs: a survey
- Eigenvalue location in threshold graphs
- On the adjacency matrix of a threshold graph
- Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
- Computing the Characteristic Polynomial of Threshold Graphs
- Distance spectrum of graph compositions
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- On the Addressing Problem for Loop Switching
- Wiener index of trees: Theory and applications