Let G be a simple graph on n vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly i ≤ n vertices and leaves in G. We study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by LG(i), realized by an induced subtree with i vertices, for 0 ≤ i ≤ n. We begin by proving that the LIS problem is NP-complete in general and then we compute the values of the map LG for some classical families of graphs and in particular for the d-dimensional hypercubic graphs Q d , for 2 ≤ d ≤ 6. We also describe a nontrivial branch and bound algorithm that computes the function LG for any simple graph G. In the special case where G is a tree of maximum degree ∆, we provide a O(n 3 ∆) time and O(n 2 ) space algorithm to compute the function LG.