Node degree distribution in spanning trees

A method is presented for computing the number of spanning trees involving one link or a specified group of links, and excluding another link or a specified group of links, in a network described by a simple graph in terms of derivatives of the spanning-tree generating function defined with respect...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. A, Mathematical and theoretical Vol. 49; no. 12; pp. 125101 - 125123
Main Author Pozrikidis, C
Format Journal Article
LanguageEnglish
Published IOP Publishing 29.03.2016
Subjects
Binomials
Derivatives
Eigenvalues
Graph theory
graphs and networks
honeycomb lattice
Kirchhoff generating function
Links
Mathematical analysis
Mathematical models
Networks
node degree distribution
spanning trees
square lattice
triangular lattice
Online AccessGet full text

Cover

More Information
Summary:A method is presented for computing the number of spanning trees involving one link or a specified group of links, and excluding another link or a specified group of links, in a network described by a simple graph in terms of derivatives of the spanning-tree generating function defined with respect to the eigenvalues of the Kirchhoff (weighted Laplacian) matrix. The method is applied to deduce the node degree distribution in a complete or randomized set of spanning trees of an arbitrary network. An important feature of the proposed method is that the explicit construction of spanning trees is not required. It is shown that the node degree distribution in the spanning trees of the complete network is described by the binomial distribution. Numerical results are presented for the node degree distribution in square, triangular, and honeycomb lattices.
Bibliography:JPhysA-104552.R1
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8113
1751-8121
DOI:10.1088/1751-8113/49/12/125101