Title of article :
on the powers of signed graphs
Author/Authors :
t v, shijin central university of kerala - department of mathematics, kasaragod, india , k a, germina central university of kerala - department of mathematics, kasaragod, india , k, shahul k m m government women s college - department of mathematics, kannur, india
Abstract :
a signed graph is an ordered pair ∑=(g,sigma), where 𝐺=(𝑉,𝐸) is the underlying graph of ∑ with a signature function δ:𝐸→ {1,1} .in this article, we define the 𝑛𝑡𝒉 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 𝑛𝑡𝒉 power of a signed graph to be unique. also, we characterize balanced power signed graphs.
Keywords :
signed graph , signed distance , distance compatibility , power of signed graphs
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
