Maximizing the degree powers of graphs with fixed size
From MaRDI portal
Publication:6180639
Recommendations
Cites work
- scientific article; zbMATH DE number 1330692 (Why is no real title available?)
- scientific article; zbMATH DE number 969189 (Why is no real title available?)
- A Turán type problem concerning the powers of the degrees of a graph
- Degree powers in \(C_5\)-free graphs
- Degree powers in graphs with a forbidden even cycle
- Degree powers in graphs with forbidden subgraphs
- Eigenvalues and triangles in graphs
- Extremal numbers for odd cycles
- Graphs with maximal number of adjacent pairs of edges
- Large cycles in graphs
- Maximal circuits of graphs. I
- Minimizer graphs for a class of extremal problems
- On degree sums of a triangle-free graph
- Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
- The spectral radius of graphs without long cycles
- Two path extremal graphs and an application to a Ramsey-type problem
Cited in
(2)
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)