Given a simple connected graph Γ and a subset of its vertices C, the pseudodistance-regularity around C generalizes, for not necessarily regular graphs, the notion of completely regular code. We then say that C is a completely pseudoregular code. Up to now, most of the characterizations of pseudo-distance-regularity has been derived from a combinatorial definition. In this paper we propose an a...
