Open AccessHexagonal Difference Prime Labeling of Some Path Graphs
Author(s) -
B S Sunoj,
Mathew Varkey
Publication year - 2017
Publication title -
mapana journal of sciences
Language(s) - English
Resource type - Journals
ISSN - 0975-3303
DOI - 10.12723/mjs.42.4
Subject(s) - combinatorics , mathematics , hexagonal crystal system , path graph , vertex (graph theory) , graph , path (computing) , prime (order theory) , computer science , line graph , graph power , chemistry , crystallography , programming language
Hexagonal difference prime labeling of vertices of a graph is the labeling of the vertices of the graph with hexagonal numbers and the edges with absolute value of the difference of the labels of the incident vertices. The greatest common incidence number (gcin) of a vertex of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is 1, then the graph admits hexagonal difference prime labeling. Here we identify some path related graphs for hexagonal difference prime labeling.