On Graphs with Maximal Sum of α-th Degree Powers
Mathematics · 09.05.2026 · 14 (10) · 1613
DOI: 10.3390/math14101613 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 09.05.2026. Verfasst von Bo-Jun Yuan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Let G be a simple graph. The sum of the α-th degree powers of G, denoted by Mα(G), is obtained by summing the α-th powers of all vertex degrees. We use Gn,m to denote the set of all graphs having n vertices and m edges. Extremal problems concerning M2(G) have a long history in combinatorics and graph theory. In 1971, Katz (Israel J. Math., 1971) first initiated the study of maximizing M2(G) within Gn,m. After nearly 40 years, Ábrego et al. (J. Inequal. Pure and Appl. Math., 2009) completely resolved this problem. In this paper, we extend the power exponent from α=2 to α>2, investigating the problem of determining the graph that maximizes the value of Mα(G) within Gn,m. We show that the graph that maximizes Mα(G) when α>2 and 1≤m≤14n2 is the quasi-star graph, which belongs to a special class of threshold graphs (defined in the Introduction).
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Yuan, B., & Wang, J. (2026). On Graphs with Maximal Sum of α-th Degree Powers. Mathematics, 14(10), 1613. https://doi.org/10.3390/math14101613
Vancouver
Yuan B, Wang J. On Graphs with Maximal Sum of α-th Degree Powers. Mathematics. 2026;14(10):1613. doi:10.3390/math14101613
BibTeX
@article{Yuan2026,
author = {Yuan, Bo-Jun and Wang, Jia-Jin},
title = {On Graphs with Maximal Sum of α-th Degree Powers},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {10},
pages = {1613},
doi = {10.3390/math14101613}
}
EUVIMED