%0 Journal Article
%T Labeling cacti with a condition at distance two
%A S. K. Vaidya
%A D. D. Bantva
%J Le Matematiche
%D 2011
%I University of Catania
%X An L(2,1)-labeling of a graph G is a function f  from the vertex set V(G) to the set of all nonnegative integers such that | f (x)- f (y)| ¡Ý 2 if d(x, y) = 1 and | f (x) - f (y)| ¡Ý 1 if d(x, y) = 2. The L(2,1)-labeling number ¦Ë(G) of G is the smallest number k such that G has an L(2,1)-labeling with max{f (v) : v   V(G)} = k. In this paper we present a graph family which has ¦Ë-number ¦¤+1 or ¦¤+2.
%K L(2
%K 1)-labeling
%K ¦Ë-number
%K Cactus graph
%K Block cut point graph
%K One point union of cycles
%U http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/775