نتایج جستجو برای: global minus dominating function

تعداد نتایج: 1632030  

Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...

Journal: :Discrete Mathematics 2004
Ruth Haas Thomas B. Wexler

Let G = (V, E) be a simple graph on vertex set V and define a function f : V → {−1, 1}. The function f is a signed dominating function if for every vertex x ∈ V , the closed neighborhood of x contains more vertices with function value 1 than with −1. The signed domination number of G, γs(G), is the minimum weight of a signed dominating function on G. Let G denote the complement of G. In this pa...

Journal: :Current Biology 2015
Anna Akhmanova Casper C. Hoogenraad

Microtubules are cytoskeletal filaments that are intrinsically polarized, with two structurally and functionally distinct ends, the plus end and the minus end. Over the last decade, numerous studies have shown that microtubule plus-end dynamics play an important role in many vital cellular processes and are controlled by numerous factors, such as microtubule plus-end-tracking proteins (+TIPs). ...

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

‎‎Let $G=(V‎, ‎E)$ be a simple graph with vertex set $V$ and edge set $E$‎. ‎A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacent‎‎or incident to at least one element $yin Vcup E$ for which $f(y)=2$‎. ‎The weight of an‎‎MRDF $f$ is $sum _{xin Vcup E} f(x)$‎. ‎The mi...

Journal: :Current Biology 2003
Alexander Dammermann Arshad Desai Karen Oegema

Microtubules are intrinsically polar structures. A consequence of this polarity is that the two ends of the microtubule polymer exhibit different properties. The more dynamic plus ends and the mechanisms that regulate their behavior have been the focus of much recent attention. Here, we concentrate on the dynamics and regulation of minus ends, which play distinct but equally critical roles in m...

2008
Byoung Du Kim Jeehoon Park Bei Zhang

We develop the plus/minus p-Selmer group theory and plus/minus padic L-function theory for an elliptic curve E with complex multiplication over an abelian extension F of the imaginary quadratic field K given by the complex multiplication of E when p is a prime inert over K/Q (i.e. supersingular). As a result, we prove that the characteristic ideal of the Pontryagin dual of the plus/minus p-Selm...

2010
A. N. Ghameshlou

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...

2014
I. M. Pelayo

A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LDcodes and the cardinality of an LD-code is the location-domination number, λ(G). An LD-set S of a graph G is global if it is an LD-set for both G and its complem...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید