1Innovation Labs, Tata Consultancy Services Ltd, Abhilash, A Block 3rd Floor,EPIP IndustrialArea, Whitefield, Bangalore-560066, Karnataka, India
2Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea
3Department of Mathematics, Vijayanagara Sri Krishnadevaraya University, Bellari, Karnataka, India
4Department of Mathematics, Faculty of Science, Uludag University, Görükle, 16059, Bursa, Turkey
Turkish Journal of Analysis and Number Theory.
2019,
Vol. 7 No. 3, 77-84
DOI: 10.12691/tjant-7-3-4
Copyright © 2019 Science and Education PublishingCite this paper: M. A. Rajan, Kinkar Ch. Das, V. Lokesha, I. Naci Cangül. On Some Properties of Coprime Labelled Graphs.
Turkish Journal of Analysis and Number Theory. 2019; 7(3):77-84. doi: 10.12691/tjant-7-3-4.
Correspondence to: Kinkar Ch. Das, Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea. Email:
kinkardas2003@googlemail.comAbstract
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.
Keywords