Maximizing the degree powers of graphs with fixed size

DOI10.1016/J.DAM.2023.10.006zbMATH Open1529.05044OpenAlexW4387629035MaRDI QIDQ6180639FDOQ6180639

Authors: Liwen Zhang, Yuke 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

Recommendations

• Degree powers in \(K_{s,t}\)-minor free graphs
• A Turán type problem concerning the powers of the degrees of a graph
• Degree powers in graphs with a forbidden forest
• Degree powers in graphs with forbidden subgraphs
• Degree powers in \(C_5\)-free graphs

zbMATH Keywords

sizemajorizationextremal graphdegree power

Mathematics Subject Classification ID

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

Cites Work

• Maximal circuits of graphs. I
• Graphs with maximal number of adjacent pairs of edges
• Title not available (Why is that?)
• Degree powers in \(C_5\)-free graphs
• Large cycles in graphs
• Minimizer graphs for a class of extremal problems
• On degree sums of a triangle-free graph
• 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
• Degree powers in graphs with forbidden subgraphs
• Degree powers in graphs with a forbidden even cycle
• Title not available (Why is that?)
• Extremal numbers for odd cycles
• The spectral radius of graphs without long cycles
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Eigenvalues and triangles in graphs

Cited In (2)

• Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
• The outdegree power of oriented graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180639)