Maximum Spread of Kr‐Minor Free Graphs
Journal of Graph Theory · 2026-09 · 113 (1) · 113-130
DOI: 10.1002/jgt.70051 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 30.04.2026. Verfasst von Wenyan Wang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 38 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Anhui Province.
Abstract (Originalsprache)
The spread of a graph is the difference between the largest and smallest eigenvalues of its adjacency matrix. In this paper, we investigate spread problems for graphs with excluded clique‐minors. We show that for sufficiently large , the ‐vertex ‐minor free graph with maximum spread is the join of a clique and an independent set, with and vertices, respectively.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Anhui Province
Zitieren
APA
Wang, W., Liu, L., & Wang, Y. (2026). Maximum Spread of Kr‐Minor Free Graphs. Journal of Graph Theory, 113(1), 113-130. https://doi.org/10.1002/jgt.70051
Vancouver
Wang W, Liu L, Wang Y. Maximum Spread of Kr‐Minor Free Graphs. Journal of Graph Theory. 2026;113(1):113-130. doi:10.1002/jgt.70051
BibTeX
@article{Wang2026,
author = {Wang, Wenyan and Liu, Lele and Wang, Yi},
title = {Maximum Spread of Kr‐Minor Free Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {113},
number = {1},
pages = {113--130},
doi = {10.1002/jgt.70051}
}
EUVIMED