Open Access
Subscription Access
Felicitous Labeling in Extended Duplicate Graph of Twig Tm
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, Twigs
User
Information
- 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.
Abstract Views: 479
PDF Views: 101