ON THE COMPUTATION OF CHARACTERISTIC POLYNOMIAL OF A CHEMICAL GRAPH

被引：0

作者：

KRIVKA, P ^{[1
]}

JERICEVIC, Z ^{[1
]}

TRINAJSTIC, N ^{[1
]}

机构：

[1] RUDJER BOSKOVIC INST, YU-41001 ZAGREB, YUGOSLAVIA

来源：

INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY | 1985年

关键词：

D O I：

暂无

中图分类号：

O64 [物理化学（理论化学）、化学物理学];

学科分类号：

070304 ; 081704 ;

摘要：

引用

页码：129 / 147

页数：19

共 50 条

[41] Computation in chemical graph rewriting networks
Flamm, Christoph
Merkle, Daniel
Stadler, Peter F.
JOURNAL OF PHYSICS-COMPLEXITY, 2025, 6 (01):
[42] Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
J. H. Reif
Algorithmica, 2001, 29 : 487 - 510
[43] A NEW METHOD ON COMPUTATION OF THE CHARACTERISTIC POLYNOMIAL FOR A CLASS OF SQUARE MATRICES
ZHENG, DZ
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1983, 28 (04) : 516 - 518
[44] Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
Reif, JH
ALGORITHMICA, 2001, 29 (03) : 487 - 510
[45] Speeding up Computation of the Reliability Polynomial Coefficients for a Random Graph
Rodionov, A. S.
AUTOMATION AND REMOTE CONTROL, 2011, 72 (07) : 1474 - 1486
[46] On computation of M-polynomial and topological indices of starphene graph
Chaudhry, Faryal
Ehsan, Muhammad
Afzal, Deeba
Farahani, Mohammad Reza
Cancan, Murat
Ediz, Suleyman
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2021, 24 (02): : 401 - 414
[47] Speeding up computation of the reliability polynomial coefficients for a random graph
A. S. Rodionov
Automation and Remote Control, 2011, 72 : 1474 - 1486
[48] GRAPHICAL-DELETING METHOD FOR COMPUTING CHARACTERISTIC POLYNOMIAL OF A GRAPH
江元生
Science China Chemistry, 1982, (07) : 681 - 689
[49] A solution to Gutman's problem on the characteristic polynomial of a bipartite graph
Li, XL
Zhang, HP
DISCRETE MATHEMATICS, 1996, 154 (1-3) : 297 - 300
[50] A GRAPH THEORETICAL RECURRENCE FORMULA FOR COMPUTING THE CHARACTERISTIC POLYNOMIAL OF MATRIX
YE, XM
UTILITAS MATHEMATICA, 1990, 38 : 165 - 174

← 1 2 3 4 5 →