Quandle coloring quivers of general torus links by dihedral quandles

We completely characterize the coloring quivers of general torus links, T(p, q) where p is prime, by dihedral quandles by first exhausting all possible numbers of colorings, followed by determining the interconnections between colorings in each case. The quiver is obtained as a function of the number of colorings. The quiver always contains complete subgraphs, in particular, a complete subgraph corresponding to the trivial colorings, but the total number of subgraphs in the quiver and the weights of their edges vary depending on the number of colorings.