Extremal graphs for weights (Q1301628): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extreme degree sequences of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank

Latest revision as of 21:27, 28 May 2024

scientific article
Language Label Description Also known as
English
Extremal graphs for weights
scientific article

    Statements

    Extremal graphs for weights (English)
    0 references
    0 references
    0 references
    0 references
    12 September 1999
    0 references
    The \(\alpha\)-weight of an edge \(xy\) of a graph \(G\) is \(d(x)^\alpha\cdot d(y)^\alpha\) where \(d(x)\) and \(d(y)\) are the degrees of the vertices \(x\) and \(y\). The \(\alpha\)-weight of \(G\) is the sum of the \(\alpha\)-weights of its edges. The authors establish the \(\alpha\)-weight of a graph with any fixed number of edges for \(\alpha=1\) and determine bounds for \(\alpha\neq 1\).
    0 references
    extremal graphs
    0 references
    weighted graphs
    0 references

    Identifiers