scientific article
From MaRDI portal
Publication:3023984
zbMath1064.05083arXivmath/0311259MaRDI QIDQ3023984
Publication date: 11 July 2005
Full work available at URL: https://arxiv.org/abs/math/0311259
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Related Items (6)
The number of rooted forests in circulant graphs ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications ⋮ On the Jacobian group of a cone over a circulant graph ⋮ An insertion algorithm and leaders of rooted trees ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
Uses Software
This page was built for publication:
