On Derivative Euler Phi Function Set-Graphs
Abstract
In this paper, we study some graph theoretical properties of two derivative Euler Phi function set-graphs. For the Euler Phi function φ(n), n∈ N, the set Sφ(n) =\i:(i,n)=1, 1≤ i ≤ n\ and the vertex set is \vi:i∈ Sφ(n)\. Two graphs Gd(Sφ(n)) and Gp(Sφ(n)), defined with respect to divisibility adjacency and relatively prime adjacency conditions, are studied.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.