• ADJACENT EDGE GRACEFUL LABELING OF CERTAIN GRAPHS
Abstract
Let G(V, E) be a graph with n vertices and m edges. The graph G is said to be an adjacent edge graceful graph if there exists a bijection ƒ: E → {1, 2,…,m} such that the induced mapping ƒ* : V→{1,2,…} b taken
Keywords
Edge graceful graph, Edge graceful labeling, friendship graph, dumbbell graph.
Full Text:
PDF![Creative Commons License](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
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 |