Irregularity strength of dense graphs (Q5905417): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1100475 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Lael F. Kinch / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3824455 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conditions for sequences to be r-graphic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3287781 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3474670 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Irregular networks, regular graphs and integer matrices with distinct row and column sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The irregularity strength of \(K_{m,m}\) is 4 for odd m / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035323 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620621 / rank | |||
Normal rank |
Latest revision as of 13:44, 15 May 2024
scientific article; zbMATH DE number 24182
Language | Label | Description | Also known as |
---|---|---|---|
English | Irregularity strength of dense graphs |
scientific article; zbMATH DE number 24182 |
Statements
Irregularity strength of dense graphs (English)
0 references
26 June 1992
0 references
Let \(G\) be a simple graph. Then positive integer weights can be assigned to the edges of \(G\) so that the weighted degrees of all vertices are distinct. An assignment of weights to the edges of \(G\) such that the weighted degrees of all vertices are distinct is called an irregular assignment of \(G\). The minimum of the largest weights over all irregular assignments of \(G\) is called the irregularity strength of \(G\). The authors determine the irregularity strength of certain unions of complete graphs. Moreover the irregularity strength of `dense' graphs is studied. In particular it is shown that if \(t\) is a fixed positive integer and if \(n\) is sufficiently large, then each graph of order \(n\) with minimum degree \(n-t\) has irregularity strength at most 3.
0 references
irregularity strength
0 references
dense graphs
0 references
irregular assignment
0 references
complete graphs
0 references
0 references