International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 40 - Issue 6 |
Published: February 2012 |
Authors: J. Shiama |
![]() |
J. Shiama . Permutation Labeling for some Shadow Graphs. International Journal of Computer Applications. 40, 6 (February 2012), 31-35. DOI=10.5120/4962-7224
@article{ 10.5120/4962-7224, author = { J. Shiama }, title = { Permutation Labeling for some Shadow Graphs }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 40 }, number = { 6 }, pages = { 31-35 }, doi = { 10.5120/4962-7224 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A J. Shiama %T Permutation Labeling for some Shadow Graphs%T %J International Journal of Computer Applications %V 40 %N 6 %P 31-35 %R 10.5120/4962-7224 %I Foundation of Computer Science (FCS), NY, USA
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.