Complexity of monad graphs generated by the function \(f(g) = g^5\)

MaRDI QIDQ6637453

Hayder B. Shelash, Ali Shukur, Hayder R. Hashim

Publication date: 13 November 2024

Published in: The Journal of Prime Research in Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed graphcyclic groupEuler phi functionmonad graph

Mathematics Subject Classification ID

Partitions; congruences and congruential restrictions (11P83) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Congruences; primitive roots; residue systems (11A07) Directed graphs (digraphs), tournaments (05C20) Primes (11A41)

This page was built for publication: Complexity of monad graphs generated by the function \(f(g) = g^5\)