Distance Regular Colorings of n-Dimensional Rectangular Grid
From MaRDI portal
Distance Regular Colorings of $n$-Dimensional Rectangular Grid
Abstract: We study the infinite graph of -dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It is proved that the elements of the parameter matrix of an arbitrary distance regular coloring form two monotonic sequences. It is shown that every irreducible distance regular coloring of the -dimensional rectangular grid has at most colors.
This page was built for publication: Distance Regular Colorings of $n$-Dimensional Rectangular Grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6257584)
