Equitable Symmetric n-Sigraphs

Abstract

a2, ..., an) , where G = (V, E) is a graph called the underlying graph of Sn and σ : E → Hn (µ : V → Hn) is a function. In this paper, we introduced a new notion equitable symmetric nsigraph of a symmetric n-sigraph and its properties are obtained. Also, we obtained the structural characterization of equitable symmetric n-signed graphs.