The sum of the squares of degrees: sharp asymptotics
From MaRDI portal
Publication:2463904
DOI10.1016/j.disc.2007.03.019zbMath1127.05054OpenAlexW2003242355MaRDI QIDQ2463904
Publication date: 6 December 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.019
Related Items
A note on de Caen's and Nikiforov's inequalities on the sum of squares of the degree sequence of a graph, Phase Changes in the Topological Indices of Scale-Free Trees, On the minimal sum of edges in a signed edge-dominated graph, Improved enumeration of simple topological graphs, Inequalities for the number of walks in graphs, Lower bounds on the general first Zagreb index of graphs with low cyclomatic number, Sums of powers of the degrees of graphs with \(k\) cut edges, Triangles in Regular Graphs with Density Below One Half, Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case, On the discrepancy between two Zagreb indices, Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity, Lagrangians of hypergraphs. II: When colex is best, The minimum degree distance of graphs of given order and size, Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false, Extreme values of the sum of squares of degrees of bipartite graphs, THE ZAGREB INDICES OF RANDOM GRAPHS, Signless Laplacian spectral radius and Hamiltonicity, Cliques in graphs with bounded minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- A problem in rearrangements of (0,1)-matrices
- An upper bound on the sum of squares of degrees in a hypergraph
- An upper bound on the sum of squares of degrees in a graph
- Maximizing the sum of the squares of the degrees of a graph
- Sums of powers of the degrees of a graph
- Rearrangements of \((0,-1)\) matrices
- Rearrangements of square matrices with non-negative elements
- Some extremal problems concerning the square of a (0,1)-matrix
- Graphs with maximal number of adjacent pairs of edges
