Some results about independent sets and independent dominating sets on the strong product of graphs and its applications

This paper presents a review of my results on the independent sets and independent dominating sets on the strong product of two paths, two cycles and path and cycle. Independent sets were introduced into the communication theory on noisy channels. A noisy channel consists of transmision alphabet T and receiving alphabet R, and the information about what letters of T can be received as what letters of R. Confusion graph C has vertices which are elements of T, and two vertices are adjacent if and only if they can be received as the same letter. If we have two noisy channels with confusion graphs C-1 and C-2 and consider strings of length two with the first element coming from the first alphabet and the second from the second alphabet, then the new confusion graph is the strong product C-1 (.) C-2.