Join Us

Bulletin of Pure and Applied Sciences- Math& Stat. (Started in 1982)
eISSN: 2320-3226
pISSN: 0970-6577
Impact Factor: 4.895 (2017)
DOI: 10.5958/2320-3226
Editor-in-Chief:  Prof. Dr. Lalit Mohan Upadhyaya
About Journal More Archive Visit IndianJournals.com
Current Issue
Guide for Authors
Journal's Ethics & Policies
Editorial Board
Reviewer Board
UGC Protocol Part 1
Article Details

Bulletin of Pure and Applied Sciences- Math& Stat. (Started in 1982)
Year : 2021, Volume & Issue : BPAS-Maths & Stat 40E(2), JUL-DEC 2021
Page No. : 167-171, Article Type : Original Aticle
Article DOI : 10.5958/2320-3226.2021.00019.9 (Communicated, edited and typeset in Latex by Lalit Mohan Upadhyaya (Editor-in-Chief). Received April 24, 2020 / Revised September 16, 2021 / Accepted October 21, 2021. Online First Published on December 17, 2021)

Prime labeling of certain graphs

J. Jeba Jesintha 1 , N.K. Vinodhini 2 and K.S.D. Subiksha 3
Author’s Affiliation : 1,3. P.G. Department of Mathematics, Women’s Christian College, University of Madras, Chennai, India. 2. Department of Mathematics, Anna Adarsh College for Women, University of Madras, Chennai, India. 1. E-mail: [email protected] 2. E-mail: [email protected] 3. E-mail: [email protected]

Corresponding Author : J. Jeba Jesintha,
E-Mail:-[email protected]


A graph $G=left(V,E ight)$ with $n$ vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding $n$ such that the label of each pair of adjacent vertices are relatively prime. In this paper we obtain the prime labeling for the middle graph of path, kite graph, one point union of shell graphs and the subdivided shell graph with star graph.

2020 Mathematics Subject Classification:  05C78.


Prime labeling, Middle graph, Kite graph, Shell graph.
Download Now

(Only for Authors and Members Not for Commercial Sale)


All rights reserved. Website Designed and Maintained by LASERWEBMAKER.COM

Publisher Ethics & Policies    |Downloads    |    Article Submission   |    Payment    |    Contact Us