Molecular Topology 22.1 Novel Connectivity Descriptors Based on Walk Degrees

Awalk, We), in a graph G = G(V, E) ia s continuous sequence of vertices.š ul> u2, ... , um' its edges and vertices are allowed to be revisited. If the two terminal vertices coincide (ul = Um), the walk is called a closed (or self returning) walk, otherwise it is an open walk. If its vertices are distinct, the walk is called a path. The number (e) of edges traversed is called the length of walk. The counting of walks of length (e), starting at vertex i E V(G), can be accomplished by summing the entries [A"], in row i of the eth power of the adjacency matrix A