• PATH RELATED NEAR MEAN CORDIAL GRAPHS
Abstract
Let G = (V, E) be a simple graph. A Near Mean Cordial Labeling of G is a function in f : V(G) {1, 2, 3, . . . , p1, p1} such that the induced map f* defined by ......
Keywords
Cordial labeling, Near Mean Cordial Labeling and Near Mean Cordial Graph.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |