@article{tjant2019734,
author={{Rajan, M. A. and Das, Kinkar Ch. and Lokesha, V. and Cang¨šl, I. Naci},
title={On Some Properties of Coprime Labelled Graphs},
journal={Turkish Journal of Analysis and Number Theory},
volume={7},
number={3},
pages={77--84},
year={2019},
url={http://pubs.sciepub.com/tjant/7/3/4},
issn={2333-1232},
abstract={A <img src=image/abs1.png></img> is a labelled graph denoted by <img src=image/abs2.png></img> in which the vertex set <img src=image/abs3.png></img> of an <img src=image/abs4.png></img> has <img src=image/abs5.png></img> vertices labeled {<img src=image/abs6.png></img>} and <img src=image/abs7.png></img> edges such that there exist an edge between two distinct vertices labeled {<img src=image/abs8.png></img> and <img src=image/abs9.png></img>}, if {<img src=image/abs10.png></img> and <img src=image/abs11.png></img>} are coprime to each other. In this paper, some properties of the <i>ER</i>-<img src=image/abs12.png></img> are studied. An algorithm to compute <i>GCD </i>and<i> LCM </i>of any two numbers between <img src=image/abs13.png></img> and p by means of an <i>ER</i>-<img src=image/abs14.png></img> graph is also described.},
doi={10.12691/tjant-7-3-4}
publisher={Science and Education Publishing}
}