Embedding of (i, j)-regular signed graphs in (i + k, j + l)-regular signed graphs

A signed graph is a graph obtained by giving signs to its edges. In this paper, we settle the problem of embedding (i, j)-regular signed graphs in (i + k, j + l)-regular signed graphs with the minimum number of vertices.