Open Access
Subscription Access
(a,d)-antimagic Labelings in Extended Duplicate Twig Graphs
In this paper, we show that the class of Extended Duplicate Graphs of a Twig is (a,d)-edge-antimagic vertex labeling. AMS subject classification: 05C78
Keywords
Graph Labeling, Duplicate Graphs, Twigs, (a,d)-edge-antimagic Vertex Labeling
User
Information
- Bodendick R and Walter G (1997) (a,d)-antimagic parachutes I I. Ars Combin. 46, 33-63.
- Gallian JA (2010) A dynamic survey of graph labeling. Elec. J Combinatories. 17, #D S6.
- Hartsfield N and Ringel G (1990) Pearls in graph theory, academic press, Boston-San Diego, New York-London.
- Nicholas T, Somasundaram S and Vilfred V (2004) On (a,d)-antimagic special trees, unicyclic graphs and complete bipartite graphs. Ars Combin. 70, 207-220.
- Rosa A (1966) On certain valuations of the vertices of a graph. Int. Symp. Rome, July 1966, Gordon & Breach NY at Dunod Paris, pp349-355.
- Thirusangu K, Selvam B and Ulaganathan PP (2010) Cordial labeling in Extended Duplicate Twig Graphs. Int. J. Computer, Mathematical Sci. Appl. 4(3-4), 319-328.
- Yegnanarayanan V (2001) On magic graphs. Util. Math. 59, 181-204
Abstract Views: 423
PDF Views: 113