A simple formula for the number of spanning trees of line graphs

Suppose G=(V,E) is a loopless graph and Sk(G) is the graph obtained from G by subdividing each of its edges k (k≥0) times. Let T(G) be the set of all spanning trees of G, L(Sk(G)) be the line graph of the graph Sk(G) and t(L(Sk(G))) be the number of spanning trees of L(Sk(G)). By using techniques fr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of graph theory 2018-06, Vol.88 (2), p.294-301
Hauptverfasser:	Gong, Helin, Jin, Xian'an
Format:	Artikel
Sprache:	eng
Schlagworte:	05C05 05C22 05C30 05C76 Combinatorial analysis Electrical networks Graph theory Graphs line graphs mesh‐star transformation spanning trees subdivision Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!