Abstract. A graph G is l-apex tree if the smallest subset of vertices A, for which G-A is a tree, has cardinality l. We study extremal values of some monotonic distance-based topological indices, such as the generalized Wiener index, in the class of l-apex trees.