𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs

✍ Scribed by PrzybyŁo, Jakub

Book ID
118197708
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
157 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the irregularity strength of trees
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

On the irregularity strength of the m ×
On the irregularity strength of the m × n grid
✍ Jeffrey H. Dinitz; David K. Garnick; Andras Gyárfás 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

## Abstract Given a graph __G__ with weighting __w__: __E__(__G__) ← __Z__^+^, the __Strength__ of __G__(__w__) is the maximum weight on any edge. The __sum__ of a vertex in __G__(__w__) is the sum of the weights of all its incident edges. The network __G__(__w__) is __irregular__ if the vertex sum