✦ LIBER ✦

Product irregularity strength of graphs

✍ Scribed by Marcin Anholcer

Book ID: 108114098
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 366 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.10.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irregularity strength of dense graphs

✍ R.J. Faudree; M.S. Jacobson; L. Kinch; J. Lehel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Irregularity strength of dense graphs

✍ 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

Irregularity strength and compound graph

Irregularity strength and compound graphs

✍ Olivier Togni 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The irregularity strength of circulant g

The irregularity strength of circulant graphs

✍ J.-L. Baril; H. Kheddouci; O. Togni 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Total edge irregularity strength of larg

Total edge irregularity strength of large graphs

✍ Florian Pfender 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 245 KB

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