Related Experiment Video
Updated: Aug 11, 2026

A Web Tool for Generating High Quality Machine-readable Biological Pathways
Published on: February 8, 2017
On walks in molecular graphs
1Faculty of Science, University of Kragujevac, P.O. Box 60, YU-34000 Kragujevac, Yugoslavia.
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.
Related Concept Videos
Molecular Shapes
Molecular Models
Molecular Orbital Theory I
Molecular Geometry and Dipole Moments
Newman Projections
The organic molecules rotate across the single bonds leading to numerous temporary three-dimensional structures of varying energy known as conformers.
pV-Diagrams

