In this paper, we discuss the construction and applications of decimated tight framelets on graphs. Based on graph clustering algorithms, a coarse-grained chain of graphs can be constructed where a suitable orthonormal eigenpair can be deduced. Decimated tight framelets can then be constructed based on the orthonormal eigen-pair. Moreover, such tight framelets are associated with filter banks with which fast framelet transform algorithms can be realized. An explicit toy example of decimated tight framelets on a graph is provided.