论文信息 - Closed‐form formulas for Kirchhoff index

Closed‐form formulas for Kirchhoff index

We find closed-form expressions for the resistance, or Kirchhoff index, of certain connected graphs using Foster's theorems, random walks, and the superposition principle. © 2001 John Wiley & Sons, Inc. Int J Quant Chem 81: 135–140, 2001

José Luis Palacios

[1] Douglas J. Klein,et al. Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distances , 1994 .

[2] Prasad Tetali. An Extension of Foster's Network Theorem , 1994, Comb. Probab. Comput..

[3] J. Palacios,et al. Random walks on edge-transitive graphs (II) , 1998 .

[4] Douglas J. Klein,et al. Distances and volumina for graphs , 1998 .

[5] R. Foster. An Extension of a Network Theorem , 1961 .

[6] István Lukovits,et al. Resistance distance in regular graphs , 1999 .

[7] Bojan Mohar,et al. The Quasi-Wiener and the Kirchhoff Indices Coincide , 1996, J. Chem. Inf. Comput. Sci..

[8] A. Neumaier,et al. Distance Regular Graphs , 1989 .

[9] P. Tetali. Random walks and the effective resistance of networks , 1991 .

[10] L. Weinberg,et al. Kirchhoff's 'Third and Fourth Laws' , 1958 .

[11] Norman L. Biggs,et al. Potential Theory on Distance-Regular Graphs , 1993, Combinatorics, Probability and Computing.