The number of spanning trees of double graphs

MaRDI QIDQ4897588zbMATH OpenFDO

Authors Wu-xin Liu, Fuyi Wei

Publication date 19 December 2012

zbMATH Keywords

bicyclic graphsdouble graphsunicyclic graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5584928
• On the upper bound for the number of spanning trees of a connected graph
• Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs
• The number of spanning trees of a graph
• On the number of spanning trees of multi-star related graphs

Cited in

(5)

• Resistance distances and the Kirchhoff index in double graphs
• Properties of strong double graphs
• Spectra of Extended Double Cover Graphs
• The number of spanning trees in a class of double fixed-step loop networks
• Research problems

This page was built for publication: The number of spanning trees of double graphs

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