Maximizing the degree powers of graphs with fixed size

DOI10.1016/j.dam.2023.10.006zbMath1529.05044OpenAlexW4387629035MaRDI QIDQ6180639

Yuke Zhang, Li-wen Zhang

Publication date: 2 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.006

zbMATH Keywords

sizemajorizationextremal graphdegree power

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• On degree sums of a triangle-free graph
• Degree powers in \(C_5\)-free graphs
• Two path extremal graphs and an application to a Ramsey-type problem
• A Turán type problem concerning the powers of the degrees of a graph
• The spectral radius of graphs without long cycles
• Degree powers in graphs with forbidden subgraphs
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Degree powers in graphs with a forbidden even cycle
• Large cycles in graphs
• Maximal circuits of graphs. I
• Graphs with maximal number of adjacent pairs of edges
• Minimizer graphs for a class of extremal problems
• Eigenvalues and triangles in graphs
• Extremal Numbers for Odd Cycles

This page was built for publication: Maximizing the degree powers of graphs with fixed size