Vol. 8, No. 2, 2015

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11, 1 issue

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Iteration digraphs of a linear function

Hannah Roberts

Vol. 8 (2015), No. 2, 221–232
Abstract

An iteration digraph G(n) generated by the function f(x) mod n is a digraph on the set of vertices V = {0,1,,n 1} with the directed edge set E = {(v,f(v))v V }. Focusing specifically on the function f(x) = 10x mod n, we consider the structure of these graphs as it relates to the factors of n. The cycle lengths and number of cycles are determined for various sets of integers including powers of 2 and multiples of 3.

Keywords
digraph, cycle, congruence
Mathematical Subject Classification 2010
Primary: 05C20, 11A07
Milestones
Received: 5 November 2012
Revised: 4 March 2013
Accepted: 9 March 2013
Published: 3 March 2015

Communicated by Robert W. Robinson
Authors
Hannah Roberts
College of Wooster
91 Benton Street
Austintown, OH 44515
United States