Counting the number of spanning trees of graphs

MaRDI QIDQ2820129zbMATH OpenFDO

Authors Modjtaba Ghorbani, E. Bani-Asadi

Publication date 13 September 2016

Published in Iranian Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL http://ijmc.kashanu.ac.ir/article_5285.html

zbMATH Keywords

fullereneLaplacian eigenvaluespanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• scientific article; zbMATH DE number 5584928
• scientific article; zbMATH DE number 1484041
• scientific article; zbMATH DE number 3966096
• Counting of spanning trees in complete graph K_p of even order
• Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs

Cited in

(8)

• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• Counting graphs with different numbers of spanning trees through the counting of prime partitions
• scientific article; zbMATH DE number 1080078 (Why is no real title available?)
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• scientific article; zbMATH DE number 5497806 (Why is no real title available?)
• scientific article; zbMATH DE number 7771742 (Why is no real title available?)
• The number of spanning trees in self-similar graphs
• Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs

This page was built for publication: Counting the number of spanning trees of graphs

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