Weighted spanning trees on some self-similar graphs

zbMath1229.05014arXiv1007.0021MaRDI QIDQ625378

Daniele D'Angeli, Alfredo Donno

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0021

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Groups acting on trees (20E08) Signed and weighted graphs (05C22)

Related Items (8)

On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The critical group of a clique-inserted graph ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ Enumeration of spanning trees on Apollonian networks ⋮ Tutte polynomial of the Apollonian network ⋮ A survey and classification of Sierpiński-type graphs ⋮ Complexity of the circulant foliation over a graph

This page was built for publication: Weighted spanning trees on some self-similar graphs