This paper investigates the construction of spectral siblings and spectral cousins-pairs of graphs whose characteristic polynomials differ by a constant or a linear function, respectively-through a series of graph operations. We establish sufficient conditions for generating families of such graphs by coalescing known siblings with specific structures.