Extremal results on degree powers in some classes of graphs

Yufei Chang, Xiaodan Chen, Shuting Zhang

Let $G$ be a simple graph of order $n$ with degree sequence $(d_1,d_2,\cdots ,d_n)$. For an integer $p>1$, let $e_p(G)={\sum }_{i=1}^n{d}_i^p$ and let $e{x}_p(n,H)$ be the maximum value…