Random Walks and Chemical Graph Theory Export

@article{citeulike:2295664, abstract = {Abstract: 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.}, address = {Texas A\&M University at Galveston, Galveston, Texas 77553, Departamento de C\'{o}mputo Cient\'{\i}fico y Estad\'{\i}stica, Universidad Sim\'{o}n Bol\'{\i}var, Apartado 89,000, Caracas, Venezuela, 3225 Kingman Road, Ames, Iowa 50311, and The Rugjer Boskovic Institute, P.O. Box 180, HR-10002 Zagreb, Croatia}, author = {Klein, D. J. and Palacios, J. L. and Randic, M. and Trinajstic, N.}, citeulike-article-id = {2295664}, citeulike-linkout-0 = {http://dx.doi.org/10.1021/ci040100e}, citeulike-linkout-1 = {http://pubs.acs.org/doi/abs/10.1021/ci040100e}, comment = {* p.3 relationship between combinatorial and normalized Laplacian (normalized is I-symmetrized adjacency) * eq.11: res\_ij=1/(d\_i P\_ji) where P\_ji is probability of getting to j before returning to i}, day = {27}, doi = {10.1021/ci040100e}, journal = {J. Chem. Inf. Comput. Sci.}, keywords = {graph-theory, resistance}, month = {September}, number = {5}, pages = {1521--1525}, posted-at = {2008-01-28 00:49:57}, priority = {2}, title = {Random Walks and Chemical Graph Theory}, url = {http://dx.doi.org/10.1021/ci040100e}, volume = {44}, year = {2004} }

TY - JOUR ID - citeulike:2295664 L3 - citeulike-article-id:2295664 N2 - Abstract: 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. IS - 5 JF - J. Chem. Inf. Comput. Sci. AD - Texas A&M University at Galveston, Galveston, Texas 77553, Departamento de Cómputo Científico y Estadística, Universidad Simón Bolívar, Apartado 89,000, Caracas, Venezuela, 3225 Kingman Road, Ames, Iowa 50311, and The Rugjer Boskovic Institute, P.O. Box 180, HR-10002 Zagreb, Croatia EP - 1525 TI - Random Walks and Chemical Graph Theory VL - 44 SP - 1521 KW - graph-theory KW - resistance N1 - * p.3 relationship between combinatorial and normalized Laplacian (normalized is I-symmetrized adjacency) * eq.11: res_ij=1/(d_i P_ji) where P_ji is probability of getting to j before returning to i AU - Klein, DJ AU - Palacios, JL AU - Randic, M AU - Trinajstic, N PY - 2004/09/27/ UR - http://dx.doi.org/10.1021/ci040100e ER -