𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computer enumeration of walks on directed graphs

✍ Scribed by K. Balasubramanian

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
526 KB
Volume
12
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

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 rooteddirected paths.

πŸ“œ SIMILAR VOLUMES

Walks on Directed Graphs and Matrix Poly
Walks on Directed Graphs and Matrix Polynomials
✍ Miguel A. MΓ©ndez πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 166 KB

We give a matrix generalization of the family of exponential polynomials in one variable , k (x). Our generalization consists of a matrix of polynomials 8 k (X)= (8 (k) i, j (X)) n i, j=1 depending on a matrix of variables X=(x i, j ) n i, j=1 . We prove some identities of the matrix exponential pol

Computer generation of characteristic po
Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 624 KB

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s

On the Mean and Variance of Cover Times
On the Mean and Variance of Cover Times for Random Walks on Graphs
✍ Frank Ball; Bruce Dunham; A Hirschowitz πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 141 KB

A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide