نتایج جستجو برای: signed graphs
تعداد نتایج: 111047 فیلتر نتایج به سال:
A conformally indecomposable flow f on a signed graph Σ is a nonzero integral flow that cannot be decomposed into f = f1 + f2, where f1, f2 are nonzero integral flows having the same sign (both ≥ 0 or both ≤ 0) at every edge. This paper is to classify at integer scale conformally indecomposable flows into characteristic vectors of Eulerian cycle-trees — a class of signed graphs having a kind of...
A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs. We employ Kronecker product of matrices to express the adjacency matrix of this product of two signed graphs and hence find its eigenvalues when the second graph under composition ...
7 We study parallel complexity of signed graphs motivated by the highly 8 complex genetic recombination processes in ciliates. The molecular gene 9 assembly operations have been modeled by operations of signed graphs, 10 i.e., graphs where the edges have a sign + or −. In the optimization prob11 lem for signed graphs one wishes to find the parallel complexity by which 12 the graph can be reduce...
let $d$ be a finite and simple digraph with vertex set $v(d)$.a signed total roman $k$-dominating function (str$k$df) on$d$ is a function $f:v(d)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin n^{-}(v)}f(x)ge k$ for each$vin v(d)$, where $n^{-}(v)$ consists of all vertices of $d$ fromwhich arcs go into $v$, and (ii) every vertex $u$ for which$f(u)=-1$ has a...
The goal of this work is to study homomorphism problems (from a computational point of view) on two superclasses of graphs: 2-edge-coloured graphs and signed graphs. On the one hand, we consider the H-Colouring problem when H is a 2-edge-coloured graph, and we show that a dichotomy theorem would imply the dichotomy conjecture of Feder and Vardi. On the other hand, we prove a dichotomy theorem f...
A signed Roman dominating function (SRDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that u∈N [v] f(u) ≥ 1 for every v ∈ V (G), and every vertex u ∈ V (G) for which f(u) = −1 is adjacent to at least one vertex w for which f(w) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman dominating functions on G with the property that ∑d i=1 fi(v) ≤ 1 for each v ∈ V (G), is called a sig...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید