Degree powers in graphs with forbidden subgraphs. (English summary) Electron. J. Combin. 11 (2004), no. 1, Research Paper 42, 8 pp. (electronic). The problem of minimizing the sum of (equal) powers of the degrees of the vertices of a graph with a given number of vertices and without a prescribed subgraph was treated by Y. Caro an
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.