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

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

Journal: :Electr. J. Comb. 2012
Polona Pavlic Janez Zerovnik

Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from {0, 1, 2}. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give O(C) time algorithm for computing Roman domination number of special classes of polygrap...

Journal: :Applied Mathematics Letters 2008

Journal: :Discrete Applied Mathematics 2015

Journal: :International Journal of Engineering & Technology 2018

Journal: :IOSR Journal of Engineering 2014

Journal: :Quaestiones Mathematicae 2020

Journal: :Discussiones Mathematicae Graph Theory 2013

Journal: :Australasian J. Combinatorics 1994
Timothy J. Bean Michael A. Henning Henda C. Swart

Let nand k be positive integers and let G be a graph. A set D of vertices of G is defined to be an (n, k )-dominating set of G if every vertex of V( G) D is within distance n from at least k vertices of D. The minimum cardinality among all (n, k )-dominating sets of G is called the (n, k )-domination number of G and is denoted by 'Yn,k(G). A set I of vertices of G is defined to be an (n, k)inde...

2012
J. Ravi Sankar Saradha Gangadharan Ravi Sankar

In this paper, we evaluate the connected domination number of (Zn), in some case of n. We find out that the connected domination number of (Z p e1 1 ×p e2 2 ×···×p ek k ) is equal to k. Finally, we characterize the graphs in which γ ( (Zn)) = γc( (Zn)). AMS subject classification: 05C25, 05C69.

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

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