An iterative approach to graph irregularity strength

被引：18

作者：

Ferrara, Michael ^{[1
]}

Gould, Ronald ^{[2
]}

Karonski, Michal ^{[2
,3
]}

Pfender, Florian ^{[4
]}

机构：

[1] Univ Colorado, Denver, CO 80217 USA

[2] Emory Univ, Atlanta, GA 30322 USA

[3] Adam Mickiewicz Univ Poznan, PL-60769 Poznan, Poland

[4] Univ Rostock, D-18051 Rostock, Germany

来源：

DISCRETE APPLIED MATHEMATICS | 2010年 / 158卷 / 11期

关键词：

Irregular labeling; Irregularity strength; TREES;

D O I：

10.1016/j.dam.2010.02.003

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An assignment of positive integer weights to the edges of a simple graph G is called irregular lithe weighted degrees of the vertices are all different. The irregularity strength, s(G), is the maximal edge weight, minimized over all irregular assignments, and is set to infinity if no such assignment is possible. In this paper, we take an iterative approach to calculating the irregularity strength of a graph. In particular, we develop a new algorithm that determines the exact value s(T) for trees T in which every two vertices of degree not equal to two are at distance at least eight. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：1189 / 1194

页数：6

共 9 条

[1] Irregularity strength of trees [J].