Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR98-003 | 3rd November 1997 00:00

Irregular Assignments of the Forest of Paths

RSS-Feed




TR98-003
Authors: I. Cahit, M. Tezer
Publication: 13th January 1998 15:08
Downloads: 1299
Keywords: 


Abstract:

An irregular assignement of $G$ is labelling $f: E \ra
\{1,2,...,m\}$ of the
edge-set of $G$ such that all of the induced vertex labels computed as
$\sigma_{v\in e}f(e)$ are distinct. The minimal number $m$ for which this
is possible is called the minimal irregularity strength $s_{m}(G)$ of $G$.
The case where all paths are of length $2$ is conidered by Aigner and
Triesch by using decomposition of additive group $Z_m$. In this paper we
have invesitgated irregular assignments of the forest of paths of regular
and irregular lengths.



ISSN 1433-8092 | Imprint