Graph Algorithms and Abstraction for Number Theoretic Concepts


Abstract views: 36 / PDF downloads: 89

Authors

  • J. Suresh Kumar PG and Research Department of Mathematics, N.S.S. Hindu College, Changanacherry, Kerala, India

Keywords:

Graph, Greatest Common Divisor, Geometric mean

Abstract

In this paper, we discuss graph theoretic representation of the number theoretic concepts such as relatively prime numbers, Greatest Common Divisor (GCD), Geometric mean (GM) and Fibonacci numbers using graph labeling. We also propose a new generalization of Geometric mean.

Downloads

Published

15-06-2019

How to Cite

J. Suresh Kumar. (2019). Graph Algorithms and Abstraction for Number Theoretic Concepts. International Journal of Mathematics And Its Applications, 7(2), 39–41. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/244

Issue

Vol. 7 No. 2 (2019)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.