On Derivative Euler Phi Function Set-Graphs

Johan Kok; Eunice Gogo Mphako-Banda; Sudev Naduvath

On Derivative Euler Phi Function Set-Graphs

General Mathematics 2019-02-01 v1

Authors: Johan Kok , Eunice Gogo Mphako-Banda , Sudev Naduvath

Abstract

In this paper, we study some graph theoretical properties of two derivative Euler Phi function set-graphs. For the Euler Phi function $\phi(n)$ , $n\in \mathbb{N}$ , the set $S_\phi(n) =\{i:\gcd(i,n)=1, 1\leq i \leq n\}$ and the vertex set is $\{v_i:i\in S_\phi(n)\}$ . Two graphs $G_d(S_\phi(n))$ and $G_p(S_\phi(n))$ , defined with respect to divisibility adjacency and relatively prime adjacency conditions, are studied.

Keywords

graph theory random graphs spectral graph theory

Cite

@article{arxiv.1901.11135,
  title  = {On Derivative Euler Phi Function Set-Graphs},
  author = {Johan Kok and Eunice Gogo Mphako-Banda and Sudev Naduvath},
  journal= {arXiv preprint arXiv:1901.11135},
  year   = {2019}
}

Comments

12 Pages, 3 Figures

On Derivative Euler Phi Function Set-Graphs

Abstract

Keywords

Cite

Comments

Related papers