Number of spanning trees of some circulant graphs and their asymptotic behavior

MaRDI QIDQ2829791zbMATH OpenFDO

Authors S. N. Daoud, H. Al-Ahmady, A. Elsonbaty

Publication date 8 November 2016

Published in International Journal of Applied Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL http://www.ceser.in/ceserp/index.php/ijamas/article/view/689

zbMATH Keywords

Chebyshev polynomialscirculant graphsnumber of spanning trees

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Recommendations

• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• The asymptotic number of spanning trees in circulant graphs
• The number of spanning trees in some circulant graphs with non-fixed jumps
• The asymptotic number of spanning trees in circulant graphs (extended abstract)
• The number of spanning trees in circulant graphs

Cited in

(8)

• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• Complexity of graphs generated by wheel graph and their asymptotic limits
• The asymptotic number of spanning trees in circulant graphs
• Complexity of the circulant foliation over a graph
• Asymptotics and arithmetical properties of complexity for circulant graphs
• The number of spanning trees in odd valent circulant graphs
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

This page was built for publication: Number of spanning trees of some circulant graphs and their asymptotic behavior

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