Random walks and chemical graph theory. Academic Article uri icon


  • Simple random walks probabilistically grown step by step on a graph are distinguished from walk enumerations and associated equipoise random walks. Substructure characteristics and graph invariants correspondingly defined for the two types of random walks are then also distinct, though there often are analogous relations. It is noted that the connectivity index as well as some resistance-distance-related invariants make natural appearances among the invariants defined from the simple random walks.

published proceedings

  • J Chem Inf Comput Sci

author list (cited authors)

  • Klein, D. J., Palacios, J. L., Randi, M., & Trinajsti, N.

citation count

  • 31

complete list of authors

  • Klein, Douglas J||Palacios, José Luis||Randić, Milan||Trinajstić, Nenad

publication date

  • September 2004