On the powers of signed graphs

被引：0

作者：

Shijin, T., V ^{[1
]}

Germina, K. A. ^{[1
]}

Hameed, K. Shahul ^{[2
]}

机构：

[1] Cent Univ Kerala, Dept Math, Kasaragod 671316, Kerala, India

[2] KMM Govt Womens Coll, Dept Math, Kannur 670004, Kerala, India

来源：

COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION | 2022年 / 7卷 / 01期

关键词：

Signed graph; signed distance; distance compatibility; power of signed graphs;

D O I：

10.22049/CCO.2021.27083.1193

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 -> {1, -1}. In this article, we define the 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.

引用

页码：45 / 51

页数：7