This paper is dedicated to the fused trend filtering on a general graph, which is a combination of fused estimator and 1-st order trend filtering on a graph. There are two cases of fusion regularisers studied in this work: anisotropic total variation (i.e. fused lasso) and nearly-isotonic restriction. For the trend filtering part we consider general trend filtering on a given graph and Kronecker trend filter for the case of lattice data. We show how these estimators are related to each other and propose a computationally feasible numerical solution with a linear complexity per iteration with respect to the amount of edges in the graph.