• SOME NEW RESULTS ON 1-NEAR MEAN CORDIAL LABELING OF GRAPHS
Abstract
Let G = (V, E) be a simple graph. A surjective function f: V(G) →{0, 1, 2} 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:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |