@article {
author = {T V, Shijin and K A, Germina and K, Shahul},
title = {On the powers of signed graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {7},
number = {1},
pages = {45-51},
year = {2022},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2021.27083.1193},
abstract = {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.},
keywords = {Signed graph,Signed distance,Distance compatibility,Power of signed graphs},
url = {https://comb-opt.azaruniv.ac.ir/article_14174.html},
eprint = {https://comb-opt.azaruniv.ac.ir/article_14174_8602679ede9109adf00cd5022f7e70b4.pdf}
}