On Some Properties of Coprime Labelled Graphs

A is a labelled graph denoted by in which the vertex set of an has vertices labeled {} and edges such that there exist an edge between two distinct vertices labeled { and }, if { and } are coprime to each other. In this paper, some properties of the ER- are studied. An algorithm to compute GCD and LCM of any two numbers between and p by means of an ER- graph is also described