Premium
Computer enumeration of walks on directed graphs
Author(s) -
Balasubramanian K.
Publication year - 1991
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.540120111
Subject(s) - enumeration , code (set theory) , combinatorics , directed graph , mathematics , matrix (chemical analysis) , discrete mathematics , computer science , set (abstract data type) , materials science , composite material , programming language
A vectorized computer code is developed for the enumeration of walks through the matrix power method for directed graphs. Application of this code to several graphs is considered. It is shown that the coefficients in the generating functions for signed graphs are much smaller in magnitude. It is shown that self‐avoiding walks on some graphs can be enumerated as a linear combination of walk GFs of directed paths and rooted‐directed paths.