On Simple Graphs Arising from Exponential Congruences

@article{Malik2012OnSG,
  title={On Simple Graphs Arising from Exponential Congruences},
  author={Muhammad Aslam Malik and Muhammad Khalid Mahmood},
  journal={J. Appl. Math.},
  year={2012},
  volume={2012},
  pages={292895:1-292895:10}
}
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pair of positive integers and , let denote the graph for which is the set of vertices and there is an edge between and if the congruence is solvable. Let be the prime power factorization of an integer , where are distinct primes. The number of nontrivial self-loops of the graph has been determined and shown to be equal to . It is shown that the graph has components. Further, it is proved that the… Expand
Loops in Digraphs of Lambert Mapping Modulo Prime Powers: Enumerations and Applications
For an odd prime number p, and positive integers k and , we denote , a digraph for which  is the set of vertices and there is a directed edge from u to v if , where  . In this work, we study isolatedExpand
A Classification of Cyclic Nodes and Enumeration of Components of a Class of Discrete Graphs
Let Zn be the ring of residue classes modulo n. Define f : Zn 㜡 Zn by f(x) = x 4 . Action of this map is studied by means of digraphs which produce an edge from the residue classes a to b if f(a) �Expand
Importance of Power Digraph in Computer Science
TLDR
In this note, some fields of interest are highlighted where power digraphs can be utilized in a more friendly way to entertain a layman without knowing much about its mathematics. Expand
New Labeling Algorithm on Various Classes of Graphs with Applications
In order to develop an algorithm, computer theories are essential and often used in a mathematical sequence. Most of them without sufficient mathematics are difficult to understand. A mathematicalExpand

References

SHOWING 1-7 OF 7 REFERENCES
On a Connection of Number Theory with Graph Theory
We assign to each positive integer n a digraph whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a2 ≡ b (mod n). We establish necessary andExpand
Symmetric Digraphs from Powers Modulo n
For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H = {0,1,2,···, n – 1} and there is a directed edge from a ∈ H to b ∈ H if a ≡ b(mod n). The digraphExpand
Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring Z
TLDR
It is shown that every component of the digraph @C(n) is a cycle if and only if 3 does not divide the Euler totient function @f(n), and n is square-free. Expand
Discrete Mathematics and Its Applications
TLDR
This text is designed for the sophomore/junior level introduction to discrete mathematics taken by students preparing for future coursework in areas such as math, computer science and engineering. Expand
The Theory of Numbers
I FIND myself to-day in the same embarrassing position in which a predecessor of mine at Oxford found himself at Bradford in 1875, the president of a Section, probably the largest and mostExpand
Power digraphs modulo n,
  • Zn,” Information Processing Letters,
  • 2008