Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21287120220601On the powers of signed graphs45511417410.22049/cco.2021.27083.1193ENShijinT VDepartment of Mathematics, Research Scholar, Central University of Kerala, Kasaragod, India.0000-0002-9850-4674GerminaK ADepartment of Mathematics, Associate Professor, Central University of Kerala, Kasaragod, IndiaShahul HameedKDepartment of Mathematics, Associate Professor, K M M Government Women's College, Kannur, India.Journal Article20210110A signed graph is an ordered pair $Sigma=(G,sigma),$ where $G=(V,E)$ is the underlying graph of $Sigma$ with a signature function $sigma:Erightarrow {1,-1}$.<br />In this article, we define the $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs. As we can define two types of signed graphs as the power of a signed graph, necessary and sufficient conditions are given for an $n^{th}$ power of a signed graph to be unique. Also, we characterize balanced power signed graphs.http://comb-opt.azaruniv.ac.ir/article_14174_8602679ede9109adf00cd5022f7e70b4.pdf