Computing the Characteristic Polynomial of Threshold Graphs

DOI10.7155/jgaa.00342zbMath1305.05105OpenAlexW2032966248MaRDI QIDQ2938758

David P. Jacobs, Vilmar Trevisan, Fernando Colman Tura

Publication date: 15 January 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00342

zbMATH Keywords

diagonalization procedurethreshold graph's adjacency matrix

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

No threshold graphs are cospectral ⋮ Efficient Computation of the Characteristic Polynomial of a Threshold Graph ⋮ On the distance spectra of threshold graphs ⋮ 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 ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Efficient computation of the characteristic polynomial of a threshold graph ⋮ On the eigenvalues distribution in threshold graphs ⋮ On the normalized spectrum of threshold graphs ⋮ Group-annihilator graphs realised by finite abelian groups and its properties ⋮ On the eccentricity spectra of threshold graphs ⋮ Fast algorithms for computing the characteristic polynomial of threshold and chain graphs ⋮ The characteristic polynomial of generalized lollipop graphs

This page was built for publication: Computing the Characteristic Polynomial of Threshold Graphs