Embedding of signed regular graphs

Abstract

A signed graph is a graph whose edges carry the weight '+' or '−'. A signed graph S is called signed-regular if d − (v) is same for all v ∈ V and d + (v) is same for all v ∈ V. The problems of embedding (i, j)-signed-regular graphs in (i, j + l)-signed-regular graphs is one of the fascinating problems from application point of view, which is dealt in this paper with insertion of least number of vertices in S.