Tight distance-regular graphs with respect to subsets

For a subset Y of the vertices of a distance-regular graph, we define a tight graph with respect to Y , which is a generalization of a tight graph introduced by Jurišić, Koolen and Terwilliger. In this paper, we study a homogeneity property of a tight graph with respect to a completely regular code.