Open Access
Subscription Access
Open Access
Subscription Access
Edge Magic Combinations of Spiders
Subscribe/Renew Journal
A total edge magic labeling of a graph with n vertices and m edges is a bijection f from VUE to the integers 1,2,……..,m + n such that there exists a constant s for any edge (u,v) in E satisfying f(u) + f(v) + f(u,v)=s. A graph is called an total edge magic graph if it has a total edge magic labeling. In this paper, we combine the spider graphs Sm,2 (m>0) with star graphs Sn (n>0) forming new graphs and show them to be total edge magic.
AMS Classification code: 05C78
Keywords
Graph Labeling, Antimagic, Spiders
Subscription
Login to verify subscription
User
Font Size
Information
- Gallian, J.A., A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, Vol. 14(2007), # DS6.
- Harary, F., Graph Theory, Addision Wesley, New Delhi,1972.
- Enomoto, H., Llado, Nagamigawa,T., and Ringel, R., On Super edge-magic graphs, SUT J. Math.,34(1998), pp. 105-109.
- Solairaju,A. and Raziya Begam,R., Edge-magic labeling of some graphs , presented in the National Conference on Applied Mathematics, March 22-23, 2007, Periyar E.V.R. College, Trichy.
Abstract Views: 308
PDF Views: 0