Counting spanning trees in a small-world Farey graph

► This paper addresses the enumeration problem of spanning trees on a Farey graph. ► We obtain an exact formula for the number of spanning trees. ► We find a numerical result for asymptotic growth constant of spanning trees. ► The constant is very different from those corresponding to other graphs. ► It is shown that topologies have a strong effect on the number of spanning trees.