@article {IOPORT.05925158,
    author       = {Germina, K.A. and Koshy, Beena},
    title        = {Independent complementary distance pattern uniform graphs.},
    year         = {2010},
    journal      = {International Journal of Mathematical Combinatorics},
    volume       = {4},
    issn         = {1937-1055},
    pages        = {63-74},
    publisher    = {The MADIS of Chinese Academy of Sciences, Beijing},
    abstract     = {Summary: A graph $G= (V,E)$ is called to be Smarandachely uniform $k$-graph for an integer $k\ge 1$ if there exists $M_1,M_2,\dots, M_k\subset V(G)$ such that $f_{M_i}(u)= \{d(u, v): v\in M_i\}$ for $\forall u\in V(G)- M_i$ is independent of the choice of $u\in V(G)- M_i$ and integer $i$, $1\le i\le k$. Each such set $M_i$, $1\le i\le k$ is called a CDPU set [Technical Report, Set-valuations of graphs and their applications, DST Project No.SR/S4/MS:277/06; {\it K. A. Germina} and {\it B. Koshy}, Int. J. Math. Comb. 4(2009), 63--74 (2010; Zbl 1238.05117)]. Particularly, for $k=1$, a Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i.e., CDPU graphs. This paper studies independent CDPU graphs.},
    identifier   = {05925158},
}