Walking Backward: Walk Counts of Negative Order.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Standard

Walking Backward: Walk Counts of Negative Order. . / Rücker, Christoph; Rücker, Gerta.
in: Journal of Chemical Information and Computer Sciences, Jahrgang 43, Nr. 4, 01.07.2003, S. 1115-1120.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

APA

Vancouver

Bibtex

@article{a69b3f6c9f0d420ab612e7bcc1e0d047,
title = "Walking Backward: Walk Counts of Negative Order. ",
abstract = "A closed formula is derived for walk counts of negative order k in a graph or molecule, as defined recently by Lukovits and Trinajsti{\'c}. 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.",
keywords = "Chemistry",
author = "Christoph R{\"u}cker and Gerta R{\"u}cker",
year = "2003",
month = jul,
day = "1",
doi = "10.1021/ci0304019",
language = "English",
volume = "43",
pages = "1115--1120",
journal = "Journal of Chemical Information and Computer Sciences",
issn = "0095-2338",
publisher = "American Chemical Society",
number = "4",

}

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 -

DOI