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

Časopis: Applied Mathematics and Computation

Volume 332

ISSN: 0096-3003

DOI: 10.1016/j.amc.2018.03.024

Stranice: 329-337

Link: https://doi.org/https://doi.org/10.1016/j.amc.2018.03.024

Apstrakt:
The characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Finding efficient algorithms for computing characteristic polynomial of graphs is an active area of research and for some graph classes, like threshold graphs, there exist very fast algorithms which exploit combinatorial structure of the graphs. In this paper, we put forward some novel ideas based on divisor technique to obtain fast algorithms for computing the characteristic polynomial of threshold and chain graphs.
Ključne reči: Adjacency matrix, Characteristic polynomial, Graph divisor, Threshold graph, Chain graph, Lexicographic product
Kategorije objave: Bibliografske reference nastavnika Univerziteta Singidunum