# On the Powers of Signed Graphs

Source: [On the Powers of Signed Graphs](<https://www.sota2.com/research/paper/68fa57591e209131ce9a4874>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:40:37.071Z

Authors: Shijin T V, Germina K A, Shahul Hameed K

Published: 2020-09-22T12:19:29.000Z

## 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 $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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2009.10486>)

[PDF](<https://arxiv.org/pdf/2009.10486.pdf>)
