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

被引：4

作者：

Andelic, M. ^{[1
]}

Simic, S. K. ^{[2
,3
]}

Zivkovic, D. ^{[4
]}

Dolicanin, E. C. ^{[2
]}

机构：

[1] Kuwait Univ, Dept Math, Safat 13060, Kuwait

[2] State Univ Novi Pazar, Vuka Karadzica Bb, Novi Pazar 36300, Serbia

[3] Math Inst SANU, Kneza Mihaila 36, Belgrade 11000, Serbia

[4] Singidunum Univ, Fac Informat & Comp, Belgrade, Serbia

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2018年 / 332卷

关键词：

Adjacency matrix; Characteristic polynomial; Graph divisor; Threshold graph; Chain graph; Lexicographic product; LEAST EIGENVALUE;

D O I：

10.1016/j.amc.2018.03.024

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2018 Elsevier Inc. All rights reserved.

引用

页码：329 / 337

页数：9

共 50 条

[1] FAST ALGORITHMS FOR THE CHARACTERISTIC POLYNOMIAL
KELLERGEHRIG, W
[J]. THEORETICAL COMPUTER SCIENCE, 1985, 36 (2-3) : 309 - 317
[2] Efficient algorithms for computing the characteristic polynomial in a domain
Abdeljaoued, J
Malaschonok, GI
[J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 2001, 156 (2-3) : 127 - 145
[3] An explicit formula for the distance characteristic polynomial of threshold graphs
Lazzarin, Joao
Marquez, Oscar F.
Tura, Fernando C.
[J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2023, 42 (05):
[4] An explicit formula for the distance characteristic polynomial of threshold graphs
João Lazzarin
Oscar F. Márquez
Fernando C. Tura
[J]. Computational and Applied Mathematics, 2023, 42
[5] Polynomial algorithms for computing the isolated toughness of interval and split graphs
Li, Fengwei
Ye, Qingfang
Broersma, Hajo
Zhang, Xiaoyan
[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (17):
[6] Chordal graphs and the characteristic polynomial
McMahon, EW
Shimkus, BA
Wolfson, JA
[J]. DISCRETE MATHEMATICS, 2003, 262 (1-3) : 211 - 219
[7] On the Characteristic Polynomial of Power Graphs
Ghorbani, Modjtaba
Abbasi-Barfaraz, Fatemeh
[J]. FILOMAT, 2018, 32 (12) : 4375 - 4387
[8] COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A TREE
Mohar, Bojan
[J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1989, 3 (04) : 403 - 406
[9] METHOD FOR COMPUTING THE CHARACTERISTIC POLYNOMIAL
MLADENOV, IM
KOTAROV, MD
VASSILEVAPOPOVA, JG
[J]. INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1980, 18 (01) : 339 - 341
[10] COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A TREE
TINHOFER, G
SCHRECK, H
[J]. COMPUTING, 1985, 35 (02) : 113 - 125

← 1 2 3 4 5 →