Node degree distribution in spanning trees

Journal of Physics A: Mathematical and Theoretical

Volumn 49, Issue 12, 2016, Pages

  Pozrikidis, C ^a  

^a University of Massachusetts   (United States)

Author keywords

graphs and networks; honeycomb lattice; Kirchhoff generating function; node degree distribution; spanning trees; square lattice; triangular lattice

Indexed keywords

EID: 84960101040     PISSN: 17518113     EISSN: 17518121     Source Type: Journal    
DOI: 10.1088/1751-8113/49/12/125101     Document Type: Article

References (11)

1. Harary F 1969 Graph Theory (Reading, MA: Addison-Wesley)
2. Pozrikidis C 2014 An Introduction to Grids, Graphs, and Networks (New York: Oxford University Press)
3. Caldarelli G 2007 Scale-Free Networks: Complex Webs in Nature and Technology (New York: Oxford University Press)
4. Wilson D B 1996 Generating random spanning trees more quickly than the cover time Proc. 28th Ann. ACM Symp. Theory of Computing pp 296-303
5. Willemain T R and Bennett M V 2002 The distribution of node degree in maximum spanning trees J. Stat. Comput. Simul. 72 101-6
6. Tzeng W-J and Wu F Y 2000 Spanning trees on hypercubic lattices and non-orientable surfaces Appl. Math. Lett. 13 19-25
7. Cvetkovič D M, Doob M and Sachs H 1979 Spectra of Graphs-Theory and Applications (New York: Academic)
8. Neidinger R D 2010 Introduction to automatic differentiation and MATLAB object-oriented programming SIAM Rev. 52 545-63
9. Manna S S, Dhar D and Majumdar S N˙ 1992 Spanning trees in two dimensions Phys. Rev. A 46 R4471-4
10. Burton R and Pemantle R 1993 Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances Ann. Probab. 21 1329-71
11. Wu F Y 1977 Number of spanning trees on a lattice J. Phys. A: Math. Gen. 10 L113-5