𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The irregularity strength of Km,m is 4 for odd m

✍ Scribed by A. Gyárfás

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
209 KB
Volume
71
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The crossing number of Cm × Cn is as con
The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1)
✍ Lev Yu. Glebsky; Gelasio Salazar 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract It has been long conjectured that the crossing number of __C~m~__ × __C~n~__ is (__m__−2)__n__, for all __m__, __n__ such that __n__ ≥  __m__ ≥  3. In this paper, it is shown that if __n__ ≥  __m__(__m__ + 1) and __m__ ≥  3, then this conjecture holds. That is, the crossing number of __