Zobrazeno 1 - 5
of 5
pro vyhledávání: '"T. V. Shijin"'
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\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properti
Externí odkaz:
http://arxiv.org/abs/2009.10486
Publikováno v:
Linear Algebra and its Applications 608 (2021), 236--247
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the dist
Externí odkaz:
http://arxiv.org/abs/2005.06202
Publikováno v:
The Journal of Mathematical Sociology. 47:244-254
Publikováno v:
Linear Algebra and its Applications. 608:236-247
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the dist
Publikováno v:
Asian-European Journal of Mathematics. 16
A signed graph [Formula: see text] is an ordered pair [Formula: see text] where [Formula: see text] is the underlying graph of [Formula: see text] with a signature function [Formula: see text]. Notions of signed distance and distance-compatible signe