International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 40 - Number 6 |
Year of Publication: 2012 |
Authors: J. SHIAMA |
10.5120/4962-7224 |
J. SHIAMA . Permutation Labeling for some Shadow Graphs. International Journal of Computer Applications. 40, 6 ( February 2012), 31-35. DOI=10.5120/4962-7224
A permutation labeling of a graph G is a bijective assignment of labels from { 1,2,3, …p} to the vertices of G such that when each edge of G has assigned a weight defined by the number of permutations of f(u) things taken f(v) at a time. Such a labeling f is called permutation labeling of G. A graph which admits permutation labeling is called permutation graphs. In this paper I proved that the shadow graphs of path Pn, star K1,n and path union of shadow graphs of cycle Cn are permutation graphs. Further I proved that the split graphs of path Pn and star K1,n are permutation graphs.