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

DOI10.1016/J.AMC.2018.03.024zbMATH Open1427.05127OpenAlexW2796075553WikidataQ130025481 ScholiaQ130025481MaRDI QIDQ2333249FDOQ2333249

E. Ć. Dolićanin, Milica Andelić, Dejan Živković, Slobodan K. Simić

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

Recommendations

• Efficient computation of the characteristic polynomial of a threshold graph
• Efficient computation of the characteristic polynomial of a threshold graph
• Computing the characteristic polynomial of threshold graphs
• Evaluation of the characteristic polynomial of a graph
• Computing the characteristic polynomial of a tree

zbMATH Keywords

adjacency matrixcharacteristic polynomialthreshold graphchain graphlexicographic productgraph divisor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• No threshold graphs are cospectral
• Evaluation of the characteristic polynomial of a graph
• Tridiagonal matrices and spectral properties of some graph classes
• Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues
• Threshold Graphs with an Arbitrary Large Gap Set

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

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