Generalized Euler Function Graphs

Authors

  • Parinyaporn Samaisong Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University
  • Supattra Chomchid Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University
  • Siripong Sirisuk Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University

Keywords:

greatest common divisor , relatively prime graph , divisor graph

Abstract

Let  n and d  be positive integers and D(n,d): =equation . For a positive divisor k of n, we define the generalized Euler function graph of type (n,d,k)  to be the graph whose vertex set is the set of integers a  in D (n,d) where the greatest common divisor of  a and n  is k, and two vertices  a and  b are adjacent if and only if the greatest common divisor of  a and b  is k. The generalized Euler function graph of type  (n, 1,1)is the Euler function graph which has already been studied. In this research, we focus on studying the generalized Euler function graphs of types (n, d, 1) and (n, 1, k). We explore properties of vertices, degree and connectivity of the graphs. Moreover, we present relationships among those graphs, relatively prime graphs and Eulerian graphs.

References

Burton, D.M. (1998). Elementary Number Theory. New York: MacGraw-Hill.

Garcia, P.G., & Ligh, S. (1983). A generalization of Euler's ϕ-Function. Fibonacci Quart., 21, 26-28.

Koshy, T. (2007). Elementary Number Theory with Applications. (2nd edition). Boston: Mass.

Madhavi, L. (2002). Studies on Domination Parameters and Enumeration of Cycles in Some Arithmetic Graphs. Ph.D. Thesis. Tirupati: S.V. University.

Manjuri, M., & Maheswari, B. (2012). Matching dominating sets of Euler-Totient-Cayley graphs. IJCER., 2, 103-107.

Manjuri, M., & Maheswari, B. (2013). Clique dominating sets of Euler totient Cayley graphs. IOSR-JM., 4, 46-49.

Pomerance, C. (1983). On the longest simple path in the divisor graph. Congr. Numer., 40, 291-304.

Sangeetha, K.J., & Maheswari, B. (2015). Edge domination in Euler-Totient-Cayley graph. IJSER., 3, 14-17.

Shanmugavelan, S. (2017). The Euler function graph G(ϕ(n)). Int. J. Pure Appl. Math., 116, 45-48.

West, D.B. (2001). Introduction to Graph Theory. New Jersey: Prentice Hall.

Wilson, R.J. (1985). Introduction to Graph Theory. New York: Longman.

Downloads

Published

2026-03-16

How to Cite

Samaisong, P. . ., Chomchid , S. . ., & Sirisuk, S. . . (2026). Generalized Euler Function Graphs. Burapha Science Journal, 28(1 January-April), 122–135. retrieved from https://li05.tci-thaijo.org/index.php/buuscij/article/view/1262