EUVIMEDEUVIMED entdecken
Crossref

Counting spanning trees in a complete bipartite graph which contain a given spanning forest

Fengming Dong, Jun Ge

Journal of Graph Theory · 2022-09 · 101 (1) · 79-94

DOI: 10.1002/jgt.22812 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 28.02.2022. Verfasst von Fengming Dong und 1 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref) und nennt 10 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let be the bipartition of the complete bipartite graph with and . We prove that for any given spanning forest of with components , the number of spanning trees in which contain all edges in is equal to where and for .

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Dong, F., & Ge, J. (2022). Counting spanning trees in a complete bipartite graph which contain a given spanning forest. Journal of Graph Theory, 101(1), 79-94. https://doi.org/10.1002/jgt.22812

Vancouver

Dong F, Ge J. Counting spanning trees in a complete bipartite graph which contain a given spanning forest. Journal of Graph Theory. 2022;101(1):79-94. doi:10.1002/jgt.22812

BibTeX
@article{Dong2022,
  author = {Dong, Fengming and Ge, Jun},
  title = {Counting spanning trees in a complete bipartite graph which contain a given spanning forest},
  journal = {Journal of Graph Theory},
  year = {2022},
  volume = {101},
  number = {1},
  pages = {79--94},
  doi = {10.1002/jgt.22812}
}
Kostenlos starten →