- Multidisciplinary Journal
- Printed Journal
- Indexed Journal
- Refereed Journal
- Peer Reviewed Journal
ISSN Print: 2394-7500, ISSN Online: 2394-5869, CODEN: IJARPF
IMPACT FACTOR (RJIF): 8.4
Important Information
- Helpline for Authors
- India: +91-9711224068
- Toll Free (India):Â 18001234070
- Working hours: 10:00 AM-06:00 PM
Issue Bar
Side Bar
Identifier
Vol. 1, Issue 12, Part M (2015)
On 0− Edge labelings in certain graphs
On 0− Edge labelings in certain graphs
Author(s)
Abstract
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.
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.
Pages: 874-877 | 1241 Views 175 Downloads
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.
Important Information
- Helpline for Authors
- India: +91-9711224068
- Toll Free (India):Â 18001234070
- Working hours: 10:00 AM-06:00 PM
Issue Bar
Side Bar
Identifier
Research Journals