论文标题
在签名图的力量上
On the Powers of Signed Graphs
论文作者
论文摘要
签名的图是一个有序的对$σ=（g，σ），$ g =（v，e）$是带有签名函数$σ的$σ$的基础图$σ：在本文中，我们定义了签名图的$ n^{th} $功率，并讨论这些签名图的这些属性的某些属性。因为我们可以将两种类型的签名图定义为签名图的功率，因此为签名图的$ n^{th} $功率提供了必要的和足够的条件，以使其唯一。另外，我们表征了平衡功率签名的图。
A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ: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.
