The numbers of spanning trees of some families of circulant graphs

zbMATH Open0978.05037MaRDI QIDQ2743083FDOQ2743083

Authors: Xiebin Chen 

Publication date: 24 September 2001

Published in: Journal of Zhangzhou Teachers College. Natural Science (Search for Journal in Brave)

Recommendations

• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• The numbers of spanning trees in undirected circulant graphs
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• Counting spanning trees in cobordism of two circulant graphs

zbMATH Keywords

spanning treesChebyshev polynomialscirculant graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cited In (18)

• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• The number of spanning trees in some classes of graphs
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• The numbers of spanning trees in undirected circulant graphs
• Title not available (Why is that?)
• On the number of spanning trees of circulant graphs
• Title not available (Why is that?)
• Counting spanning trees in cobordism of two circulant graphs
• Counting spanning trees of \((1, N\))-periodic graphs
• Chebyshev polynomials and formulas for a number of spanning trees in circulant graphs
• The number of rooted forests in circulant graphs
• Counting rooted spanning forests in cobordism of two circulant graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• The formulas for the number of spanning trees in circulant graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees in odd valent circulant graphs

This page was built for publication: The numbers of spanning trees of some families of circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743083)