Construction of Mutually Orthogonal Graph Squares Using Novel Product Techniques

Table 1

The nomenclature used in the paper.

Nomenclature
	Degree of a vertex
	The group
	Complete graph with vertices
	Complete bipartite graph having two independent sets of sizes and
	Cycle of length
	Path on vertices
	Disjoint union of and
	disjoint copies of
	Entry in row and column of a square matrix
	Cartesian product operation
	path obtained by replacing each edge in by the graph