✦ LIBER ✦

Irregularity strength of dense graphs

✍ Scribed by R.J. Faudree; M.S. Jacobson; L. Kinch; J. Lehel

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 832 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90161-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Bill Cuckler; Felix Lazebnik 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract Let __G__ be a simple graph of order __n__ with no isolated vertices and no isolated edges. For a positive integer __w__, an assignment __f__ on __G__ is a function __f__: __E__(__G__) → {1, 2,…, __w__}. For a vertex __v__, __f__(__v__) is defined as the sum __f__(__e__) over all edges

On graph irregularity strength

✍ Alan Frieze; Ronald J. Gould; Michał Karoński; Florian Pfender 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract An assignment of positive integer weights to the edges of a simple graph __G__ is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, __s__(__G__), is the maximal weight, minimized over all irregular assignments. In this study, we show

Irregularity strength of regular graphs

Irregularity strength of regular graphs of large degree

✍ D. Amar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The irregularity strength of tKp

✍ Stanislav Jendroľ; Michal Tkáč 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Assign positive integer weights to the edges of a simple graph G (with no isolated edges and vertices) of order at least 3 in such a way that the graph becomes irregular, i.e. the weight sums at the vertices become pairwise distinct. The minimum of the largest weights assigned over all such irregula

The irregularity strength of tP3

✍ Lael Kinch; Jenő Lehel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Let (a,, . . . , a,, b,, . . . , b,) be the sequence of distinct positive integers such that ai + bi are distinct for i = 1, . . . , t, and different from ai and bj, 1 si s t. Denote by s(t) the minimum of the largest element of these sequences for fixed t. In this note we prove s(t) 2 [(15t -1)/71

On the irregularity strength of trees

✍ Tom Bohman; David Kravitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract For any graph __G__, let __n~i~__ be the number of vertices of degree __i__, and $\lambda (G)={max} \_{i\le j}\{ {n\_i+\cdots +n\_j+i-1\over j}\}$. This is a general lower bound on the irregularity strength of graph __G__. All known facts suggest that for connected graphs, this is the a