Signed degree sequences in signed multipartite graphs
نویسندگان
چکیده
منابع مشابه
Signed degree sequences in signed multipartite graphs
A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...
متن کاملSigned Degree Sequences in Signed Bipartite Graphs
A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...
متن کاملSigned degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملA Note on Signed Degree Sets in Signed Bipartite Graphs
A signed bipartite graph G(U, V ) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V ) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V ) is called its signed degree set. In this paper, we prove that every set ...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hacettepe Journal of Mathematics and Statistics
سال: 2015
ISSN: 1303-5010
DOI: 10.15672/hjms.2015449661