Maximizing the sum of the squares of the degrees of a graph (Q1877650): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kinkar Chandra Das / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Thomas Andreae / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.04.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027792620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds for the Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal entries in the principal eigenvector of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for degree sequences / rank
 
Normal rank

Latest revision as of 20:07, 6 June 2024

scientific article
Language Label Description Also known as
English
Maximizing the sum of the squares of the degrees of a graph
scientific article

    Statements

    Maximizing the sum of the squares of the degrees of a graph (English)
    0 references
    19 August 2004
    0 references
    The author presents several interesting upper bounds for the sum of the squares of the degrees of a graph, thereby supplementing previous work of \textit{D. de Caen} [Discrete Math. 185, No. 1--3, 245--248 (1998; Zbl 0955.05059)] and \textit{L. A. Székely}, \textit{L. H. Clark} and \textit{R. C. Entringer} [Discrete Math. 103, No. 3, 293--300 (1992; Zbl 0767.05013)].
    0 references
    0 references
    Graph
    0 references
    Degree sequence
    0 references
    Upper bound
    0 references
    0 references
    0 references