Walking Backward: Walk Counts of Negative Order.
Research output: Journal contributions › Journal articles › Research › peer-review
Standard
Walking Backward : Walk Counts of Negative Order. . / Rücker, Christoph; Rücker, Gerta.
In: Journal of Chemical Information and Computer Sciences, Vol. 43, No. 4, 01.07.2003, p. 1115-1120.Research output: Journal contributions › Journal articles › Research › peer-review
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - JOUR
T1 - Walking Backward
T2 - Walk Counts of Negative Order.
AU - Rücker, Christoph
AU - Rücker, Gerta
PY - 2003/7/1
Y1 - 2003/7/1
N2 - A closed formula is derived for walk counts of negative order k in a graph or molecule, as defined recently by Lukovits and Trinajstić. Some unexpected observations made by these authors easily follow from this formula. Gratifyingly, the formula is very similar to the one obtained earlier for usual walk counts. Moreover, while for walk counts of k → +∞ the numerically largest eigenvalue of the adjacency matrix plays an important part, for walk counts of k → -∞ the numerically smallest eigenvalue plays a corresponding part.
AB - A closed formula is derived for walk counts of negative order k in a graph or molecule, as defined recently by Lukovits and Trinajstić. Some unexpected observations made by these authors easily follow from this formula. Gratifyingly, the formula is very similar to the one obtained earlier for usual walk counts. Moreover, while for walk counts of k → +∞ the numerically largest eigenvalue of the adjacency matrix plays an important part, for walk counts of k → -∞ the numerically smallest eigenvalue plays a corresponding part.
KW - Chemistry
UR - http://www.scopus.com/inward/record.url?scp=18344400043&partnerID=8YFLogxK
U2 - 10.1021/ci0304019
DO - 10.1021/ci0304019
M3 - Journal articles
VL - 43
SP - 1115
EP - 1120
JO - Journal of Chemical Information and Computer Sciences
JF - Journal of Chemical Information and Computer Sciences
SN - 0095-2338
IS - 4
ER -