Toughness, k-factor and spectral radius of bipartite graphs
Discrete Applied Mathematics · 2027-01 · 396 · 170-179
DOI: 10.1016/j.dam.2026.08.049 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2027-01. Verfasst von Shucheng Li und 3 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: China Postdoctoral Science Foundation, National Natural Science Foundation of China, Natural Science Foundation of Xinjiang Uygur Autonomous Region.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- China Postdoctoral Science Foundation
- National Natural Science Foundation of China
- Natural Science Foundation of Xinjiang Uygur Autonomous Region
Zitieren
APA
Li, S., Chen, Y., Li, D., & Kong, W. (2027). Toughness, k-factor and spectral radius of bipartite graphs. Discrete Applied Mathematics, 396, 170-179. https://doi.org/10.1016/j.dam.2026.08.049
Vancouver
Li S, Chen Y, Li D, Kong W. Toughness, k-factor and spectral radius of bipartite graphs. Discrete Applied Mathematics. 2027;396:170-179. doi:10.1016/j.dam.2026.08.049
BibTeX
@article{Li2027,
author = {Li, Shucheng and Chen, Yuanyuan and Li, Dan and Kong, Weihong},
title = {Toughness, k-factor and spectral radius of bipartite graphs},
journal = {Discrete Applied Mathematics},
year = {2027},
volume = {396},
pages = {170--179},
doi = {10.1016/j.dam.2026.08.049}
}
EUVIMED