Path magic graphs
Journal: Sciencia Acta Xaveriana (Vol.2, No. 1)Publication Date: 2011-03-01
Authors : A. Lourdusamy; P. Annammal; T. Nicholas;
Page : 73-82
Keywords : Pn-magic; path magic; A-labeling.;
Abstract
Let G = (V;E) be a graph with jVj = p and jEj = q. A total labeling l : V [E !f1;2; : : : ; p+qg is a bijection. The weight l : V [E !N is a function induced by l such that l(v) = l(v)+åxv l(vx) and l(e) = l(u)+l(v)+l(e), where e = uv. If l(v) is a constant for all v 2 V, then G is called vertex-magic. If l(e) is a constant for all e 2 E, then G is said to be edge magic. If G is both vertex magic and edge magic, G is called a totally magic graph. In this paper, we define path magic graphs and prove that any star graph is path magic. We also prove that totally magic graphs are path magic, but not the converse.
Other Latest Articles
- On a special case of the Diophantine equation “ax2+bx+c=dyn”
- Assessment of heavy metal pollution status of Vembanadu lake-a case study, Kerala
- Edge mean graph
- Phytochemical constituent and antimicrobial activities of T.asthamatica leaves
- Salubrious Effect of Tylophora Asthmatica on Paracetamol Hepatotxity
Last modified: 2014-08-19 13:40:34