Enumeration for no-trivial spanning forests of complete bipartite graphs.
From MaRDI portal
Publication:3115019
zbMATH Open1249.05191MaRDI QIDQ3115019FDOQ3115019
Authors: Fengying Huang, Bolian Liu 
Publication date: 20 February 2012
Recommendations
- Enumeration for spanning forests of complete bipartite graphs.
- scientific article; zbMATH DE number 2192142
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- Some applications of spanning trees in \(K_{s,t}\)
- On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (10)
- 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
- Title not available (Why is that?)
- Enumeration for spanning forests of complete bipartite graphs.
- Combinatorial proof of an Abel-type identity
- Computing the number of \(h\)-edge spanning forests in complete bipartite graphs
- Some applications of spanning trees in \(K_{s,t}\)
- An f-chromatic spanning forest of edge-colored complete bipartite graphs
- Binomial identities generated by counting spanning trees.
- Title not available (Why is that?)
This page was built for publication: Enumeration for no-trivial 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 Q3115019)
