Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ulaganathan, P. P.
- Graceful and Skolem Graceful Labeling in Extended Duplicate Graph of Path
Abstract Views :394 |
PDF Views:124
Authors
Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, IN
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, IN
Source
Indian Journal of Science and Technology, Vol 4, No 2 (2011), Pagination: 107-111Abstract
In this paper, we prove that the Extended Duplicate Graph of Path is Graceful and Skolem-graceful. AMS subject classification: 05C78Keywords
Graph Labeling, Graceful Labeling, Skolem-graceful Labeling, Extended Duplicate GraphFull Text
References
- Gallian JA (2010) A dynamic survey of graph labeling. Elec. J. Combin. 17, # DS6.
- Golomb SW (1997) How to number a graph, in graph theory and computing, RC Read, ed., Academic press, NY. pp:23-37.
- Lee SM, Wang S and Wui I (1988) On Skolemgracefulness of 4 stars. Congr. Number. 62, 235-239.
- Rosa A (1967) On certain valuations of the vertices of a graph, theory of graphs (Int. Symp. Rome, July 1966), Gordon and Breech NY and Dunod paris.pp:349-355.
- Thirusangu K, Ulaganathan PP and Selvam B (2010) Cordial labeling in duplicate graphs. Int. J. Computer Math. Sci. Appl. 4(1-2), 179-186.
- Youssef MZ (2003) New families of graceful graphs. Ars. Combin. 67, 303-311
- (a,d)-antimagic Labelings in Extended Duplicate Twig Graphs
Abstract Views :423 |
PDF Views:113
Authors
Affiliations
1 Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai–600073, IN
1 Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai–600073, IN
Source
Indian Journal of Science and Technology, Vol 4, No 2 (2011), Pagination: 112-115Abstract
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: 05C78Keywords
Graph Labeling, Duplicate Graphs, Twigs, (a,d)-edge-antimagic Vertex LabelingFull Text
References
- 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
- Felicitous Labeling in Extended Duplicate Graph of Twig Tm
Abstract Views :477 |
PDF Views:101
Authors
Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai – 600 073, IN
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai – 600 073, IN
Source
Indian Journal of Science and Technology, Vol 4, No 5 (2011), Pagination: 586-589Abstract
In this paper, we show that the class of Extended Duplicate Graph of a Twig is Felicitious.Keywords
Graph Labeling, Graceful Labeling, Felicitious Labeling, Duplicate Graphs, TwigsFull Text
References
- Balakrishnan R and Kumar R (1994) Existence and nonexistence of certain labellings for the graph Kc 2K2. Util. Math. 46 97-102.
- Balakrishnan R, Selvam A and Yegnanarayanan V (1996) On felicitious labelings of graphs. Proc. Natl. Workshop on Graph Theory and Its Appl. Manonmaniam Sundaranar Univ., Tiruneli. pp: 47-61.
- Gallian JA (2010) A Dynamic survey of graph labeling. The Electr. J. Combinatorics. 17,# DS6.
- Golomb SW (1972) How to number a graph, in Graph theory and computing. Read RC (ed.), Academic Press, NY. pp: 23-37.
- Lee SM, Schmeichel E and Shee SC (1991) On felicitious graphs, Discrete Math. 93, 201-209.
- Rosa A (1966) On certain valuations of the vertices of a graph. Intl. Symp., Rome, Gordon & Breach, N.Y. at Dunod Paris. pp: 349-355.
- Selvam B, Thirusangu K and Ulaganathan PP (2011) Graceful and Skolem graceful labelings in Extended Duplicate Twig graphs. Intl. J. Combinatorics Graph Theory & Applications. (Accepted for Publications).
- Thirusangu K, Selvam B and Ulaganathan PP (2010) Cordial Labeling in Extended Duplicate Twig graphs. Intl. J. Computer, Math. Sci. & Applications. 4 (3-4), 319-328.
- Yegnanarayanan V (1999) On some additive analogues of graceful theme: cycle-related graphs. Southeast Asian Bull. Math. 23, 317–333.
- Super Edge-magic Total Labeling in Extended Duplicate Graph of Path
Abstract Views :347 |
PDF Views:121
Authors
Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600 073, IN
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai-600 073, IN
Source
Indian Journal of Science and Technology, Vol 4, No 5 (2011), Pagination: 590-592Abstract
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 GraphsFull Text
References
- 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.