Answers are grounded in this paper and cite their sources.
For each prime \(p ≥ 5\), the \(Γ_1\)-nonderanged permutation group \(G_pΓ_1=\{ω_1, …, ωₚ₋₁\}\), with multiplication \(ω_i ω_j=ωi j p\), is cyclic of order \(n=p-1\). Its order-divisor graph has the group elements as vertices, with distinct vertices adjacent precisely when their orders differ and one order divides the other. In view of the established divisor-class construction for cyclic groups, this graph is an independent-set expansion of the divisibility-comparability graph on the divisors of \(n\). We express this description in the permutation indexing, obtain formulas for the degrees and number of edges, and determine connectivity, regularity, diameter, radius, girth, center, and periphery. In particular, the identity is always universal; the unique involution is also universal exactly when \(p-1\) is a power of 2 . The graph is complete multipartite precisely when \(p-1=2^k(k ≥ 2)\) or \(p-1=2 q\) for an odd prime \(q\). Explicit matrices and graph drawings for \(p=5,7,11\), together with direct enumeration for all 107 primes \(5 ≤ p<600\), illustrate and check the specializations.
No takes yet. Share an insight, caveat, or question.
Dauda et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: