On the powers of signed graphs

Communications in Combinatorics and Optimization

article

T V, Shijin¹  K A, Germina²  K, Shahul Hameed³ 

[1] Department of Mathematics, Research Scholar, Central University of Kerala;Department of Mathematics, Associate Professor, Central University of Kerala;Department of Mathematics, Associate Professor, K M M Government Women',s College

关键词: Signed graph;    signed distance;    distance compatibility;    power of signedgraphs;   

DOI  :  10.22049/cco.2021.27083.1193

学科分类：社会科学、人文和艺术（综合）

来源: Azarbaijan Shahide Madani Universit

【 摘 要 】

A signed graph is an ordered pair Σ = (G, σ), where G = (V, E) is theunderlying graph of Σ with a signature function σ : E → {1, −1}. In this article, wedefine the nth power of a signed graph and discuss some properties of these powers ofsigned graphs. As we can define two types of signed graphs as the power of a signedgraph, necessary and sufficient conditions are given for an nth power of a signed graphto be unique. Also, we characterize balanced power signed graphs.

【 授权许可】

CC BY-SA