TY - JOUR ID - 14174 TI - On the powers of signed graphs JO - Communications in Combinatorics and Optimization JA - CCO LA - en SN - 2538-2128 AU - T V, Shijin AU - K A, Germina AU - K, Shahul Hameed AD - Department of Mathematics, Research Scholar, Central University of Kerala, Kasaragod, India. AD - Department of Mathematics, Associate Professor, Central University of Kerala, Kasaragod, India AD - Department of Mathematics, Associate Professor, K M M Government Women's College, Kannur, India. Y1 - 2022 PY - 2022 VL - 7 IS - 1 SP - 45 EP - 51 KW - Signed graph KW - Signed distance KW - Distance compatibility KW - Power of signed graphs DO - 10.22049/cco.2021.27083.1193 N2 - A signed graph is an ordered pair $\Sigma=(G,\sigma),$ where $G=(V,E)$ is the underlying graph of $\Sigma$ with a signature function $\sigma:E\rightarrow \{1,-1\}$.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. UR - http://comb-opt.azaruniv.ac.ir/article_14174.html L1 - http://comb-opt.azaruniv.ac.ir/article_14174_8602679ede9109adf00cd5022f7e70b4.pdf ER -