Zobrazeno 1 - 10
of 211
pro vyhledávání: '"Germina, K. A."'
Autor:
Mathew, Albin, A, Germina K.
A signed graph is a graph whose edges are labeled either as positive or negative. The concept of vector valued switching and balancing dimension of signed graphs were introduced by S. Hameed et al. In this paper, we deal with the balancing dimension
Externí odkaz:
http://arxiv.org/abs/2306.10132
Autor:
Mathew, Albin, A., Germina K.
In this paper, we define the Mycielskian of a signed graph and discuss the properties of balance and switching in the Mycielskian of a given signed graph. We provide a condition for ensuring the Mycielskian of a balanced signed graph remains balanced
Externí odkaz:
http://arxiv.org/abs/2302.00946
Autor:
Mathew, Albin1 albinmathewamp@gmail.com, Germina, K. A.1 srgerminaka@gmail.com
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 4, p759-771. 13p.
A signed graph is a graph with edges marked positive and negative; it is unbalanced if some cycle has negative sign product. We introduce the concept of vector valued switching function in signed graphs, which extends the concept of switching to high
Externí odkaz:
http://arxiv.org/abs/2208.00149
A signed graph is a graph whose edges are labeled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance laplacian matrices. We characterize balance in signed graphs usi
Externí odkaz:
http://arxiv.org/abs/2010.04204
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
Let $G=(V,\overrightarrow{E})$ be a graph with some prescribed orientation for the edges and $\Gamma$ be an arbitrary group. If $f\in \mathrm{Inv}(\Gamma)$ be an anti-involution then the skew gain graph $\Phi_f=(G,\Gamma,\varphi,f)$ is such that the
Externí odkaz:
http://arxiv.org/abs/2009.10487
A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for the cartesi
Externí odkaz:
http://arxiv.org/abs/2009.08707
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graph
Externí odkaz:
http://arxiv.org/abs/2009.08708
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