نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
3 A function f : V (G) → {+1,−1} defined on the vertices of a graph G is a signed domi4 nating function if for any vertex v the sum of function values over its closed neighborhood 5 is at least one. The signed domination number γs(G) of G is the minimum weight of a 6 signed dominating function on G. By simply changing “{+1,−1}” in the above definition 7 to “{+1, 0,−1}”, we can define the minus ...
A function f :V (G) → {−1, 0, 1} defined on the vertices of a graph G is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF f is minimal if there does not exist an MTDF g:V (G) → {−1, 0, 1}, f = g, for which g(v) f (v) for every v ∈ V (G). The weight of an MTDF is the sum of its function values over all vertices. The mi...
We introduce the price of symmetrisation, a concept that aims to compare fundamental differences (gap and quotient) between values of a given graph invariant for digraphs and the values of the same invariant of the symmetric versions of these digraphs. Basically, given some invariant our goal is to characterise digraphs that maximise price of symmetrisation. In particular, we show that for some...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید