Enumeration of spanning trees of 2-separable networks

Tianyu Li and Weigen Yan

Physica A: Statistical Mechanics and its Applications, 2019, vol. 536, issue C

Abstract: Gong and Li (2017) considered the enumerative problem of a special class of so-called 2-separable networks. In this paper, we pay attention to the general 2-separable networks and obtain a more general result on the number of spanning trees of 2-separable networks. As applications, we enumerate spanning trees of some networks in the context of statistical physics, which generalizes the results in Zhang et al. (2011).

Keywords: Spanning tree; Enumeration problem; 2-separable networks (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119304923
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:536:y:2019:i:c:s0378437119304923

DOI: 10.1016/j.physa.2019.04.113

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().