Computing the characteristic polynomial of threshold graphs

DOI10.7155/JGAA.00342MaRDI QIDQ2938758zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Efficient computation of the characteristic polynomial of a threshold graph
• Efficient computation of the characteristic polynomial of a threshold graph
• Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
• scientific article; zbMATH DE number 1472121
• Evaluation of the characteristic polynomial of a graph

Cited in

(25)

• Evaluation of the characteristic polynomial of a graph
• No threshold graphs are cospectral
• On the distance spectra of threshold graphs
• 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
• The role of the anti-regular graph in the spectral analysis of threshold graphs
• Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
• The characteristic polynomial of generalized lollipop graphs
• A method to calculate the characteristic polynomials of a graph on n vertices by the aid of a computer
• Diagonalization of generalized lollipop graphs
• Efficient computation of the characteristic polynomial of a threshold graph
• scientific article; zbMATH DE number 1472121 (Why is no real title available?)
• Efficient computation of the characteristic polynomial of a threshold graph
• An alternate proof of the formula for the characteristic polynomial of a threshold graph
• An explicit formula for the distance characteristic polynomial of threshold graphs
• Locating Eigenvalues of Symmetric Matrices - A Survey
• On the Seidel spectrum of threshold graphs
• On Radenković and Gutman conjecture for some classes of trees of diameter 5
• On the distance cospectrality of threshold graphs
• On the eccentricity inertia indices of chain graphs
• On the Seidel Laplacian spectrum of threshold graphs
• On Radenković and Gutman conjecture for certain classes of trees
• Distance Laplacian spectra of threshold graphs

This page was built for publication: Computing the characteristic polynomial of threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938758)