Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{155664,
        author = {S.RAGULSANKAR and V.RAJESWARI},
        title = {MULTIPLICATIVE LABELING BASED ON MAXIMUM DEGREE FOR SOME SIMPLE CONNECTED GRAPH},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {1},
        pages = {1520-1523},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=155664},
        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.},
        keywords = {Maximum degree, Crown graph, Path graph, Star graph, Equal Bistar graph},
        month = {},
        }