%0 Journal Article
%T Some new perspectives on distance two labeling
%A S K Vaidya
%A D D Bantva
%J International Journal of Mathematics and Soft Computing
%D 2013
%I SweDha Publication
%X An $L(2,1)$-labeling (or distancetwo labeling) of a graph $G$ is a function $f$ from the vertex set$V(G)$ to the set of nonnegative integers such that$|f(u)-f(v)|geq2$ if $d(u,v)=1$ and $|f(u)-f(v)|geq1$ if$d(u,v)=2$. The $L(2,1)$-labeling number $lambda(G)$ of $G$ is thesmallest number $k$ such that $G$ has an $L(2,1)$-labeling withmax${f(v):v in V(G)}=k$. In this paper we find $lambda$-number for some cacti.
%K Interference
%K channel assignment
%K distance two labeling
%K $lambda$-number
%K cactus
%U http://ijmsc.com/index.php/ijmsc/article/view/IJMSC063/3-3-2