文章基本信息

标题：Hexagonal Difference Prime Labeling of Some Cycle Related Graphs
本地全文：下载
作者：Sunoj B S ; Mathew Varkey T K
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：6
页码：10437
DOI：10.15680/IJIRSET.2017.0606042
出版社：S&S Publications
摘要：The labeling of a graph, we mean assign some integers to the vertices or edges (or both) of the graph. Inthis paper we developed a new kind of labeling, called hexagonal difference prime labeling. Here the vertices of thegraph are labeled with hexagonal numbers and the edges are labeled with absolute difference of the end vertex labels.Here the greatest common incidence number (g c i n) of a vertex of degree greater than one is defined as the g c d of thelabels of the incident edges. If the g c i n of each vertex of degree greater than one is 1, then the graph admits hexagonaldifference prime labeling. Here we characterize some cycle related graphs for hexagonal difference prime labeling.
关键词：Graph labeling; hexagonal numbers; g c i n; prime labeling; cycle.