title: On walks in molecular graphs.
abstract: Walks in molecular graphs and their counts for a long time have found applications in theoretical chemistry. These are based on the fact that the (i, j)-entry of the kth power of the adjacency matrix is equal to the number of walks starting at vertex i, ending at vertex j, and having length k. In recent papers (refs 13, 18, 19) the numbers of all walks of length k, called molecular walk counts, mwc(k), and their sum from k = 1 to k = n - 1, called total walk count, twc, were proposed as quantities suitable for QSPR studies and capable of measuring the complexity of organic molecules. We now establish a few general properties of mwc's and twc among which are the linear dependence between the mwc's and linear correlations between the mwc's and twc, the spectral decomposition of mwc's, and various connections between the walk counts and the eigenvalues and eigenvectors of the molecular graph. We also characterize the graphs possessing minimal and maximal walk counts.
authors: Faculty of Science, University of Kragujevac, P.O. Box 60, YU-34000 Kragujevac, Yugoslavia.
authors: I
authors: I
authors: Gutman
authors: C
authors: C
authors: Rücker
authors: G
authors: G
authors: Rücker