Computing the number of h-edge spanning forests in complete bipartite graphs

MaRDI QIDQ5167711zbMATH OpenFDO

Authors Douglas S. Stones

Publication date 1 July 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2311/0.html

zbMATH Keywords

complete bipartite graphspanning forest

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• Enumeration for spanning forests of complete bipartite graphs.
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• Enumeration for no-trivial spanning forests of complete bipartite graphs.
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs

Cited in

(7)

• Counting spanning trees in a complete bipartite graph which contain a given spanning forest
• Enumeration for spanning forests of complete bipartite graphs.
• Countingk-component forests of a graph
• Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
• Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
• An f-chromatic spanning forest of edge-colored complete bipartite graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs

Describes a project that uses

Uses Software

• gmp

This page was built for publication: Computing the number of \(h\)-edge spanning forests in complete bipartite graphs

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