Permutation Labeling For Some Special Graphs

摘要

A (p, q)-graph G is said to be a permutation graph if G admits an assignment of distinct integers 1, 2, 3, ..., p to the vertices such that edge values obtained by number of permutation of larger vertex value taken smaller vertex value at a time are distinct. In this paper, we prove that a class of planar graph Pl_n, (P_2 ∪ mK_1) + N_2, Jelly Fish, umbrella and windmill has permutation labeling.