International Journal of Applied Research
Vol. 1, Issue 12, Part M (2015)
On 0− Edge labelings in certain graphs
In this paper we prove that the complete nary pseudo tree, two dimensional cylindrical meshes Pm × Cn, n ≡ 0(mod2), n− dimensional hypercube Qn, the graph obtained by at- taching Cm to mK1, n(m ≡ 0(mod 2), The circular ladder graph, The friendship graph Cn(m) and the graph Pm ×Pm ×Pm are 0− edge magic graphs.
How to cite this article:
K Thirusangu, P Nedumaran. On 0− Edge labelings in certain graphs. Int J Appl Res 2015;1(12):874-877.