Ḣ-Join operation of signed graphs constrained by indexing maps

Let H be a graph of order k and let F = { G 1 , G 2 , . . . , G k } be a family of k graphs. Then the H -join of the family F is obtained by replacing each vertex v i of H with the graph G i of F and respecting the adjacencies existing in H . To generalise this graph operation we consider a signed variant with the addition of fixing m ∈ N and introducing indexing maps to define the Ḣ m -join. Once having done so we can determine the characteristic polynomials and spectra of the compound graphs produced as pertaining to many graph matrices, such as the adjacency, Laplacian, universal adjacency, net Laplacian, and A α . Furthermore we show that the Ḣ m -join remains stable under switching of Ḣ .