نتایج جستجو برای: minus k domination number

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

Journal: :communication in combinatorics and optimization 0
maryam atapour department of mathematics faculty of basic sciences university of bonab bonab, iran, po. box: 5551761167 abdollah khodkar department of mathematics university of west georgia carrollton, ga 30118, usa

let $d=(v,a)$ be a finite simple directed graph. a function$f:vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (tmdf) if $f(n^-[v])ge 1$ and $f(n^+[v])ge 1$ for eachvertex $vin v$. the twin minus domination number of $d$ is$gamma_{-}^*(d)=min{w(f)mid f mbox{ is a tmdf of } d}$. inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...

Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...

Journal: :Australasian J. Combinatorics 2004
Laura M. Harris Johannes H. Hattingh

A two-valued function f defined on the vertices of a graph G = (V,E), f : V → {−1, 1}, is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. That is, for every v ∈ V, f(N(v)) ≥ 1, where N(v) consists of every vertex adjacent to v. The weight of a total signed dominating function is f(V ) = ∑ f(v), over all vertices v ∈ V . The total ...

Journal: :Australasian J. Combinatorics 2002
Hailong Liu Liang Sun

In this paper, we give upper bounds on the upper signed domination number of [l, k] graphs, which generalize some results obtained in other papers. Further, good lower bounds are established for the minus ksubdomination number γ−101 ks and signed k-subdomination number γ −11 ks .

Journal: :Discrete Mathematics 2001
Jirí Matousek

For a graph G, a function f : V (G) ! f?1; 0; +1g is called a minus-domination function of G if the closed neighborhood of each vertex of G contains strictly more

Journal: :Discrete Mathematics 1999
Jean E. Dunbar Stephen T. Hedetniemi Michael A. Henning Alice A. McRae

We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G = (V, E) of the form f : V + { 1, 0, l}. Such a fknction is said to be a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every t’ E V, ,f(N[r~])> 1, where N[a] consists of 1: and every vertex adjacent...

Journal: :Malaya Journal of Matematik 2021

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

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