• 1 -NEAR MEAN CORDIAL LABELING OF QUADRILATERAL SNAKE, LADDER, UMBRELLA GRAPHS
Abstract
Let G= (V, E) be a simple graph. A surjective function is said to be a 1-Near Mean Cordial labeling if for each edge uv, the induced map......
Keywords
1-Near Mean Cordial Labeling, 1-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 |