Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition

DOI10.5614/ejgta.2016.4.2.5zbMath1467.05034OpenAlexW2531143660MaRDI QIDQ5006587

Sung Sik U

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2016.4.2.5

zbMATH Keywords

enumerationspanning treejoin graphspanning forest

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (1)

On the Jacobian group of a cone over a circulant graph

Cites Work

• The asymptotic number of spanning forests of complete bipartite labelled graphs
• Bijections for Cayley trees, spanning trees, and their q-analogues
• The number of spanning trees of a complete multipartite graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition