%0 Journal Article
%T On the powers of signed graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A T V, Shijin
%A K A, Germina
%A K, Shahul Hameed
%D 2022
%\ 06/01/2022
%V 7
%N 1
%P 45-51
%! On the powers of signed graphs
%K Signed graph
%K Signed distance
%K Distance compatibility
%K Power of signed graphs
%R 10.22049/cco.2021.27083.1193
%X 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:Erightarrow {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.
%U http://comb-opt.azaruniv.ac.ir/article_14174_8602679ede9109adf00cd5022f7e70b4.pdf