|
|
|
|
on the powers of signed graphs
|
|
|
|
|
|
|
|
نویسنده
|
t v shijin ,k a germina ,k shahul
|
|
منبع
|
communications in combinatorics and optimization - 2022 - دوره : 7 - شماره : 1 - صفحه:45 -51
|
|
چکیده
|
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.
|
|
کلیدواژه
|
signed graph ,signed distance ,distance compatibility ,power of signed graphs
|
|
آدرس
|
central university of kerala, department of mathematics, india, central university of kerala, department of mathematics, india, k m m government women's college, department of mathematics, india
|
|
پست الکترونیکی
|
shabrennen@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|