Coset component signed graph of a group

In this paper, the notion of a newly derived signed graph called a coset component graph, based on cosets of subgroups of a group is introduced. Let [Formula: see text] be a group and [Formula: see text] be its subgroup. Then, the coset component graph of [Formula: see text] in [Formula: see text], denoted by [Formula: see text], is a simple graph with the vertex set consisting of elements of [Formula: see text] and two vertices say, [Formula: see text] are adjacent if either [Formula: see text] or [Formula: see text]. A coset component signed graph of [Formula: see text] in [Formula: see text] is a signed graph whose edges get the sign in accordance with their inclusion in the edge set of the corresponding coset component graph. The structure and important properties of the coset component signed graphs are determined in this paper.