scientific article; zbMATH DE number 5497806

MaRDI QIDQ5505302zbMATH OpenFDO

Authors Shengning Qiao, Bing Chen

Publication date 26 January 2009

Full work available at URL https://eudml.org/doc/55351, http://www.emis.de/journals/AMEN/2009/2009.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 5584928
• The number of spanning trees of a graph
• The number of spanning trees of a graph
• The number of spanning trees in some classes of graphs
• Counting the number of spanning trees of graphs
• The number of spanning tree in several classes of graphs
• The number of spanning trees of composite graphs
• Number of spanning trees in the sequence of some graphs
• The number of spanning trees in regular graphs

Cited in

(9)

• The bridge number of arborescent links with many twigs
• Conditions on the distillation for determining optimal chain lengths of a graph
• scientific article; zbMATH DE number 1926055 (Why is no real title available?)
• scientific article; zbMATH DE number 2094529 (Why is no real title available?)
• scientific article; zbMATH DE number 5584928 (Why is no real title available?)
• Enumeration of spanning trees in a chain of diphenylene graphs
• Sequences of spanning trees and a fixed tree theorem
• The number of spanning trees in self-similar graphs
• Types of special graphs and their complexity trees

This page was built for publication:

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