Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes
Given a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regularity around $C$ generalizes, for not necessarily regular graphs, the notion of completely regular code. We then say that $C$ is a completely pseudo-regular code. Up to now, most of the characterizations of pseudo-distance-regularity has been …