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

M. Anđelić, S.K. Simić, D. Živković and E.Ć. Dolićanin

Applied Mathematics and Computation, 2018, vol. 332, issue C, 329-337

Abstract: 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.

Keywords: Adjacency matrix; Characteristic polynomial; Graph divisor; Threshold graph; Chain graph; Lexicographic product (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318301899
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:332:y:2018:i:c:p:329-337

DOI: 10.1016/j.amc.2018.03.024

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().