Counting maximal distance-independent sets in grid graphs
\(G_{p,q,r} = (V, E)\) is called 3-dimensional grid graph of size \(p \times q \times r\) (or \((p,q,r)\)-grid graph) with vertex set NEWLINE\[NEWLINEV = \{ (i,j,k) : 1 \leq i \leq p, 1 \leq j \leq q, 1 \leq k \leq n \}NEWLINE\]NEWLINE and edge set NEWLINE\[NEWLINEE = \{ (i,j,k), (i',j',k') : |i - i'| + |j - j'| + |k - k'| = 1 \},NEWLINE\]NEWLINE where \(p\), \(q\), \(r\) are natural numbers. Some properties of the \((p,q,r)\)-grid graphs are discussed. Matrix representations of them are shown.
scientific article; zbMATH DE number 6221384