𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total edge irregularity strength of large graphs

✍ Scribed by Florian Pfender


Book ID
113567430
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
245 KB
Volume
312
Category
Article
ISSN
0012-365X

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