Open Access
Subscription Access
Super Edge-magic Total Labeling in Extended Duplicate Graph of Path
In this paper, we prove that the Extended Duplicate Graph of a path is super edge-magic.
Keywords
Graph Labeling, Super Edge-magic Total Labeling, Extended Duplicate Graphs
User
Information
- Enomoto H, Llado AS, Nakamigawa T and Ringel G (1998) Super edge-magic. SUT. J. Math. 34, 105-109.
- Figueroa-Centeno R, Ichishima R and Muntaner-Batle F (2001) The place of super edge-magic labelings among other classes of labeling. Discrete Math. 231, 153-168.
- Gallian JA (2010) A dynamic survey of graph labeling. The Electronic J. Combinatories. 17, # DS6.
- Kotzig A and Rosa A (1970) Magic valuations of finite graphs. Canad. Math. Bull. 13, 451-461.
- Rosa A (1967) On certain valuations of the vertices of a graph. Theory of Graphs. Intl. Sym. Rome, July 1966, Gordon & Breech, N.Y. and Dunod Paris. pp: 349-355.
- Thirusangu K, Ulaganathan PP and Selvam B (2010) Cordial labeling in duplicate graphs. Intl. J. Computer. Math. Sci. & Appl. 4 (1-2), 179-186.
- Wallis WD (2001) Magic Graphs. Birkhäuser, Boston.
Abstract Views: 347
PDF Views: 121