Directed graphs from exact covering systems
From MaRDI portal
Abstract: Given an exact covering system (mod ) , we introduce the corresponding exact covering system digraph (ECSD) . The vertices of are the integers and the edges are for each 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 at each vertex. We also explore the link between ECSDs that have a single component and non-standard digital representations of integers.
Recommendations
Cites work
Cited in
(3)
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)