Degree powers in \(C_5\)-free graphs

DOI10.1007/s40840-014-0106-9zbMath1322.05076arXiv1304.1680OpenAlexW1727563672MaRDI QIDQ745946

Ran Gu, Yongtang Shi, Xue Liang Li

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1680

zbMATH Keywords

\(H\)-free graphTurán-type problemdegree power

Mathematics Subject Classification ID

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

Related Items (12)

Entropy of weighted graphs with Randić weights ⋮ Degree-based entropies of networks revisited ⋮ The maximum outdegree power of complete \(k\)-partite oriented graphs ⋮ Bounds for degree-based network entropies ⋮ Degree powers of graphs without \(B_{\ell,s}\) ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Degree powers in graphs with a forbidden forest ⋮ Extremality of degree-based graph entropies ⋮ Nordhaus-Gaddum type results for graph irregularities ⋮ On extremal hypergraphs for forests of tight paths ⋮ A spectral condition for the existence of a pentagon in non-bipartite graphs ⋮ Degree powers in \(K_{s,t}\)-minor free graphs

Cites Work

• Extreme values of the sum of squares of degrees of bipartite graphs
• 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
• Degree Powers in Graphs: The Erdős–Stone Theorem
• On maximal paths and circuits of graphs
• Unnamed Item

This page was built for publication: Degree powers in \(C_5\)-free graphs