A
labelling or numbering of a graph G is the assignment of labels to the graph's
vertices, which results in a labelling for each edge uv based on the vertex
labels f(u) and f(f) (v). Neighborhood prime labelling of Star graphs, Complete
bipartite graphs, Fan graphs, Friendship graphs, Flower graphs, Bistar graphs,
Comb graphs, Pn splitting graphs, and K1,n splitting graphs are covered in this
work. Also covered are the neighbourhood prime labelling in the Ring sum of
cycles Cn and K1,n, as well as various graph operations on the Fan and
Friendship graphs.
Author (s) Details
Dr. T. J.
Rajesh Kumar
Department of
Mathematics, TKM College of Engineering, Kollam, Kerala, India.
View
Book :- https://stm.bookpi.org/CTMCS-V5/article/view/2434
Thursday, 5 August 2021
Study on Neighborhood Prime Labeling | Chapter 7 | Current Topics on Mathematics and Computer Science Vol. 5
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment