文章基本信息

标题：EVEN GRACEFUL LABELLING OF A CLASS OFTREES
本地全文：下载
作者：Mathew Varkey T.K ; Rajesh Kumar T.J
期刊名称：International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks
印刷版ISSN：0975-7260
电子版ISSN：0975-7031
出版年度：2015
卷号：7
期号：4
页码：1
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G thatinduces for each edge uv a labelling depending on the vertex labels f(u) and f(v). A labelling is called agraceful labelling if there exists an injective function f: V (G) → {0, 1,2,......q} such that for each edge xy,the labelling │f(x)-f(y)│is distinct. In this paper, we prove that a class of Tn trees are even graceful.
关键词：labelling; even graceful graph; tree.