EUVIMEDEUVIMED entdecken
Crossref

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs

Shaohan Xu, Kexiang Xu, Ivan Damnjanović

Discussiones Mathematicae Graph Theory · 2026 · 46 (2) · 507

DOI: 10.7151/dmgt.2614 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discussiones Mathematicae Graph Theory, 2026. Verfasst von Shaohan Xu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Xu, S., Xu, K., & Damnjanović, I. (2026). Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs. Discussiones Mathematicae Graph Theory, 46(2), 507. https://doi.org/10.7151/dmgt.2614

Vancouver

Xu S, Xu K, Damnjanović I. Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs. Discussiones Mathematicae Graph Theory. 2026;46(2):507. doi:10.7151/dmgt.2614

BibTeX
@article{Xu2026,
  author = {Xu, Shaohan and Xu, Kexiang and Damnjanović, Ivan},
  title = {Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs},
  journal = {Discussiones Mathematicae Graph Theory},
  year = {2026},
  volume = {46},
  number = {2},
  pages = {507},
  doi = {10.7151/dmgt.2614}
}
Kostenlos starten →