Authors: M.Murugan
In this paper, we consider special class of trees called uniform k-distant trees,which have many interesting properties. We show that they have an edge-magic total labeling, a super edge-magic total labeling, a (a, d)-edge-antimagic vertex labeling, an (a, d)-edge-antimagic total labeling, a super (a, d)- edge-antimagic total labeling. Also we introduce anew labeling called edge bi-magic vertex labeling and prove that every uniform k-distant tree has edge bi-magic vertex labeling.
Comments: 8 Pages.
Download: PDF
[v1] 2014-11-19 00:23:30
Unique-IP document downloads: 113 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.