Felicitous Labeling of Some Path Related of Graphs Renuka J.1, Balaganesan P.2 1Assistant Professor, Women's Christian College, Chennai 2Associate Professor, AMET Deemed to be University, Chennai, India Online published on 4 October, 2018. Abstract In this paper, It is proved that the regular banana tree B(m, n) for any positive integer n, n + 1 > m is even is a felicitous graph and proved that one vertex union of B (m, n) B(m, l) for m = 2, l > n > 3 or m = 3, l >n > 4 is a felicitous graph. And a collection of same size of path passing through mid-vertex of anther path is felicitous labeling. Also proved that lobster with one leg, the P-spl (Pn) for any n is felicitous labeling. Further, the square graph of path and Bi-star are felicitous and the graph Pn (+) mK1 is felicitous for any m and n even. Top Keywords Felicitous labeling, regular banana tree, one vertex union, lobster, P-spl(Pn), square graph, Bi-star, Pn(+) mK1. Top |