Enumeration of spanning trees of middle graphs

Weigen Yan

Applied Mathematics and Computation, 2017, vol. 307, issue C, 239-243

Abstract: Let G be a simple graph with n vertices and m edges, and Δ and δ the maximum degree and minimum degree of G. Suppose G′ is the graph obtained from G by attaching Δ−dG(v) pendent edges to each vertex v of G. Huang and Li (Bull. Aust. Math. Soc. 91(2015), 353–367) proved that if G is regular (i.e., Δ=δ,G=G′), then the middle graph of G, denoted by M(G), has 2m−n+1Δm−1t(G) spanning trees, where t(G) is the number of spanning trees of G. In this paper, we prove that t(M(G)) can be expressed in terms of the summation of weights of spanning trees of G with some weights on its edges. Particularly, we prove that if G is irregular (i.e., Δ ≠ δ), then t(M(G′))=2m−n+1Δm+k−1t(G), where k is the number of vertices of degree one in G′.

Keywords: Line graph; Spanning tree; Middle graph; Generalized Wye-Delta transform (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317301510
Full text for ScienceDirect subscribers only

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:apmaco:v:307:y:2017:i:c:p:239-243

DOI: 10.1016/j.amc.2017.02.040

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().