In this paper, we find recursive formula for the Tutte polynomial of a family of smallworld

Farey graph, which is modular and has an exponential degree hierarchy. As the applications

of the recursive formula, the exact expressions for the chromatic polynomial and the reliability

polynomial of Fare graphs are derived and the number of connected spanning subgraphs are also

obtained.