Abstract
The subject of mutually orthogonal Latin squares (MOLSs) has fascinated researchers for many years. Although there is a number of intriguing results in this area, many open problems remain to which the answers seem as elusive as ever. Mutually orthogonal graph squares (MOGSs) are considered a generalization to MOLS. MOLS are considered an area of combinatorial design theory which has many applications in optical communications, cryptography, storage system design, wireless communications, communication protocols, and algorithm design and analysis, to mention just a few areas. In this paper, we introduce a technique for constructing the mutually orthogonal disjoint union of graphs squares and the generalization of the Kronecker product of MOGS as a generalization to the MacNeish's Kronecker product of MOLS. These are useful for constructing many new results concerned with the MOGS.