The number of spanning trees in $$K_n$$-complement of a bipartite graph
Journal of Algebraic Combinatorics · 2024-09 · 60 (2) · 541-554
DOI: 10.1007/s10801-024-01341-y ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 01.06.2024. Verfasst von Helin Gong und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: Natural Science Foundation of Zhejiang Province, National Natural Science Foundation of China, Natural Science Foundation of Sichuan Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Natural Science Foundation of Zhejiang Province
- National Natural Science Foundation of China
- Natural Science Foundation of Sichuan Province
Zitieren
APA
Gong, H., Gong, Y., & Ge, J. (2024). The number of spanning trees in $$K_n$$-complement of a bipartite graph. Journal of Algebraic Combinatorics, 60(2), 541-554. https://doi.org/10.1007/s10801-024-01341-y
Vancouver
Gong H, Gong Y, Ge J. The number of spanning trees in $$K_n$$-complement of a bipartite graph. Journal of Algebraic Combinatorics. 2024;60(2):541-554. doi:10.1007/s10801-024-01341-y
BibTeX
@article{Gong2024,
author = {Gong, Helin and Gong, Yu and Ge, Jun},
title = {The number of spanning trees in $$K_n$$-complement of a bipartite graph},
journal = {Journal of Algebraic Combinatorics},
year = {2024},
volume = {60},
number = {2},
pages = {541--554},
doi = {10.1007/s10801-024-01341-y}
}
EUVIMED