On Some Properties of Coprime Labelled Graphs
Autor: | M. A. Rajan, I. Naci Cangul, V. Lokesha, Kinkar Ch. Das |
---|---|
Rok vydání: | 2019 |
Předmět: | |
Zdroj: | Turkish Journal of Analysis and Number Theory. 7:77-84 |
ISSN: | 2333-1100 |
DOI: | 10.12691/tjant-7-3-4 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |