MULTIPLICATIVE LABELING BASED ON MAXIMUM DEGREE FOR SOME SIMPLE CONNECTED GRAPH

MULTIPLICATIVE LABELING BASED ON MAXIMUM DEGREE FOR SOME SIMPLE CONNECTED GRAPH
Author(s):
S.RAGULSANKAR, V.RAJESWARI
Keywords:
Maximum degree, Crown graph, Path graph, Star graph, Equal Bistar graph
Abstract
A Graph G with p vertices and q edges is said to be multiplicative labeling based on maximum degree graph if the vertices are assigned distinct number 1,2,3,……,p such that the labels induced on the edges by the product of the end vertices divided by its maximum degree are distinct. We prove some of the graphs such as Crown Graph, Path Graph, Star Graph, Equal Bi-Star Graph are multiplicative labeling based on maximum degree graph.
Article Details
Unique Paper ID: 155664 Publication Volume & Issue: Volume 9, Issue 1 Page(s): 1520 - 1523
Article Preview & Download

Share This Article

NCSST-2021

AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2021

LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT

Last Date: 7th November 2021

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org