A signed graph is an ordered pair Σ=(G,σ), where G=(V,E) is the underlying graph of Σ with a signature function σ:E→{1,−1}. In this article, we define nth 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 nth power of a signed graph to be unique. Also, we characterize balanced power signed graphs.
@article{arxiv.2009.10486,
title = {On the Powers of Signed Graphs},
author = {Shijin T and Germina K A and Shahul Hameed K},
journal= {arXiv preprint arXiv:2009.10486},
year = {2020}
}