Enumeration for spanning forests of complete bipartite graphs.

Recommendations

Cited in

(20)

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
Effective resistances and spanning trees in the complete bipartite graph plus a matching
Enumeration for no-trivial spanning forests of complete bipartite graphs.
scientific article; zbMATH DE number 3884200 (Why is no real title available?)
scientific article; zbMATH DE number 4142059 (Why is no real title available?)
scientific article; zbMATH DE number 3989380 (Why is no real title available?)
The asymptotic number of spanning forests of complete bipartite labelled graphs
scientific article; zbMATH DE number 1778429 (Why is no real title available?)
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
The number of rooted forests in circulant graphs
scientific article; zbMATH DE number 7499713 (Why is no real title available?)
Computing the number of h-edge spanning forests in complete bipartite graphs
An f-chromatic spanning forest of edge-colored complete bipartite graphs
scientific article; zbMATH DE number 2192142 (Why is no real title available?)
Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications
On the Jacobian group of a cone over a circulant graph
Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
A rooted-forest partition with uniform vertex demand

This page was built for publication: Enumeration for spanning forests of complete bipartite graphs.

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