On the heights of power digraphs modulo n

@article{Ahmad2012OnTH,
  title={On the heights of power digraphs modulo n},
  author={Uzma Ahmad and Husnine Syed},
  journal={Czechoslovak Mathematical Journal},
  year={2012},
  volume={62},
  pages={541-556}
}
A power digraph, denoted by G(n, k), is a directed graph with ℤn = {0, 1, &h., n − 1} as the set of vertices and E = {(a, b): ak ≡ b (mod n)} as the edge set. In this paper we extend the work done by Lawrence Somer and Michal Křžek: On a connection of number theory with graph theory, Czech. Math. J. 54 (2004), 465–485, and Lawrence Somer and Michal Křžek: Structure of digraphs associated with quadratic congruences with composite moduli, Discrete Math. 306 (2006), 2174–2185. The heights of the… Expand
The power digraphs associated with generalized dihedral groups
  • Uzma Ahmad
  • Mathematics, Computer Science
  • Discret. Math. Algorithms Appl.
  • 2015
TLDR
All regular and semi-regular power digraphs γDn(2n,k) are completely classified and the analysis of distance between vertices culminates at different expressions in terms of n and k to determine the heights of vertices, components and the powerDigraph itself. Expand
The power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(mod , n)}$ as the edge set, where $n$ and $k$ are any positiveExpand
The classification of finite groups by using iteration digraphs
A digraph is associated with a finite group by utilizing the power map f: G → G defined by f(x) = xkfor all x ∈ G, where k is a fixed natural number. It is denoted by γG(n, k). In this paper, theExpand
The digraphs arising by the power maps of generalized quaternion groups
We attach a diagraph with generalized Quaternion group of order 4n by utilizing the power map f : Q4n → Q4n defined by f(x) = xk for all x ∈ Q4n, where k is a fixed natural number. We examine theExpand
Periodic points and tail lengths of split polynomial maps modulo primes
Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailedExpand

References

SHOWING 1-10 OF 17 REFERENCES
On symmetric digraphs of the congruence xk = y (mod n)
TLDR
This work generalizes earlier theorems by Szalay, Carlip, and Mincheva on symmetric digraphs G(n,2) of order 2 to symmetricDigraphs M of order M when k>=2 is arbitrary. Expand
Structural Properties of Power Digraphs Modulo n
We define G(n, k) to be a directed graph whose set of vertices is {0, 1, ..., n− 1} and whose set of edges is {(a, b) : a ≡ b (mod n)}. We say that G(n, k) is symmetric of order m if we can partitionExpand
Structure of digraphs associated with quadratic congruences with composite moduli
We assign to each positive integer n a digraph G(n) whose set of vertices is H={0,1,...,n-1} and for which there exists a directed edge from a@?H to b@?H if a^2=b(modn). Associated with G(n) are twoExpand
DIGRAPHS FROM POWERS MODULO p
Given any function / defined modulo m, we can consider the digraph that has the residues modulo m as vertices and a directed edge (a, b) if and only if f(a) = h (mod m). This digraph can be thoughtExpand
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
On semiregular digraphs of the congruence xk = y (mod n)
A method of mapping voltage potential along a metal structural member extending underground through a range of depths comprises the steps of providing a voltage meter having positive and negativeExpand
Symmetry of iteration graphs
We examine iteration graphs of the squaring function on the rings ℤ/nℤ when n = 2kp, for p a Fermat prime. We describe several invariants associated to these graphs and use them to prove that theExpand
Applied and algorithmic graph theory
TLDR
This maths text is written for upper-level college students who have had previous coursework involving proofs and proof techniques, and includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. Expand
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
TLDR
This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject. Expand
Graphviz - Open Source Graph Drawing Tools
TLDR
Graphviz is a heterogeneous collection of graph drawing tools containing batch layout programs, a platform for incremental layout, customizable graph editors, utility programs useful in graph visualization; and libraries for attributed graphs. Expand
...
1
2
...