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

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

2008
Douglas F. Rall

The dual notions of domination and packing in finite simple graphs were first extensively explored by Meir and Moon in [15]. Most of the lower bounds for the domination number of a nontrivial Cartesian product involve the 2-packing, or closed neighborhood packing, number of the factors. In addition, the domination number of any graph is at least as large as its 2-packing number, and the invaria...

2013
Luérbio Faria Wing-Kai Hon Ton Kloks Hsiang Hsuan Liu Tao-Ming Wang Yue-Li Wang

A function f : V → {−1, 0, 1} is a minus-domination function of a graph G = (V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The weight of f is the sum of f(x) over all vertices x ∈ V. The minus-domination number γ(G) is the minimum weight over all minus-domination functions. The size of a minus domination is the number of vertices that are assigned 1....

Journal: :Journal of the Operations Research Society of China 2013

Journal: :Journal of Scientific Research 2013

Journal: :Journal of Scientific Research 2011

Journal: :Communications on Applied Electronics 2017

Journal: :International Journal of Engineering & Technology 2018

Journal: :Malaya Journal of Matematik 2019

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

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