Directed graphs from exact covering systems

From MaRDI portal



Abstract: Given an exact covering system (mod di) , we introduce the corresponding exact covering system digraph (ECSD) GS=G(d1n+a1,ldots,drn+ar). The vertices of GS are the integers and the edges are (n,din+ai) for each ninmathbbZ and for each congruence in the covering system. We study the structure of these directed graphs, which have finitely many components, one cycle per component, as well as indegree 1 and outdegree r at each vertex. We also explore the link between ECSDs that have a single component and non-standard digital representations of integers.






Describes a project that uses

Uses Software






This page was built for publication: Directed graphs from exact covering systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026960)