Fast algorithms for computing the characteristic polynomial of threshold and chain graphs

DOI10.1016/j.amc.2018.03.024zbMath1427.05127OpenAlexW2796075553WikidataQ130025481 ScholiaQ130025481MaRDI QIDQ2333249

E. Ć. Dolićanin, Milica Anđelić, Dejan Živković, Slobodan K. Simic

Publication date: 12 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.024

zbMATH Keywords

characteristic polynomialadjacency matrixchain graphthreshold graphlexicographic productgraph divisor

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

No threshold graphs are cospectral ⋮ Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues ⋮ Tridiagonal matrices and spectral properties of some graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalue location for chain graphs
• Combinatorial approach for computing the characteristic polynomial of a matrix
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• On the first eigenvalue of bipartite graphs
• Threshold graphs and related topics
• Spectra of graphs obtained by a generalization of the join graph operation
• Computing the Characteristic Polynomial of Threshold Graphs
• Threshold Graph Limits and Random Threshold Graphs
• Efficient Computation of the Characteristic Polynomial of a Threshold Graph
• The Complexity of the Partial Order Dimension Problem
• A new graph product and its spectrum
• Graph Classes: A Survey
• Difference graphs

This page was built for publication: Fast algorithms for computing the characteristic polynomial of threshold and chain graphs