Prime Labeling of House Graphs

Author(s): Ezhil A and Arigovindhan K

Abstract:

Consider G = (M,N) be a graph with Қ points and U lines is said to be prime labeling if the points are labeled with distinct integers that do not exceed ‘Қ’, so that each pair of neighboring points a and b are relatively Prime. Prime labeling is an important area in Graph theory, as it connects number theory with Graph structures and provides arithmetic properties. In this paper, we focus on the study of Prime labeling for different families of Graphs. In particular, we examine the Prime Labeling of House graph and its denoted by HS. Various observations, characterization, and results are discussed to highlight how prime labeling can be established for these graph classes.

keywords:

Pages: 37-39     |    1 View     |    0 Download