DC FieldValueLanguage
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorŽivković, Dejanen
dc.contributor.authorDolićanin, Edinen
dc.date.accessioned2020-05-01T20:12:45Z-
dc.date.available2020-05-01T20:12:45Z-
dc.date.issued2018-09-01en
dc.identifier.issn0096-3003en
dc.description.abstractThe 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.en
dc.publisherElsevier-
dc.relationKuwait University, Grant no. SM06/16-
dc.relation.ispartofApplied Mathematics and Computationen
dc.subjectAdjacency matrix | Chain graph | Characteristic polynomial | Graph divisor | Lexicographic product | Threshold graphen
dc.titleFast algorithms for computing the characteristic polynomial of threshold and chain graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.amc.2018.03.024en
dc.identifier.scopus2-s2.0-85044865832en
dc.relation.firstpage329en
dc.relation.lastpage337en
dc.relation.volume332en
dc.description.rankM21a-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Show simple item record

SCOPUSTM   
Citations

3
checked on Apr 8, 2022

Page view(s)

9
checked on Apr 8, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.