Disjunctive domination in graphs with minimum degree at least two
نویسندگان
چکیده
A set D of vertices in G is a disjunctive dominating if every vertex not adjacent to or has at least two distance 2 from it G. The domination number, γ2d(G), the minimum cardinality In this paper, we show that be graph order 3, δ(G)≥2 and with no component isomorphic any eight forbidden graphs, then γ2d(G)≤|G|3. Moreover, provide an infinite family graphs attaining bound. addition, also study case claw-free degree two.
منابع مشابه
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree δ ≥ 2 and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 1 3 + 2 3g ) n. As a corollary this implies that for cubic graphs of order n and girth g ≥ 5 the domination number γ satisfies γ ≤ ( 44 135 + 82 135g ) n which improves recent results due to Kostochka and Stodolsky (An upper bound on the domination number of n-vertex connected cubic...
متن کاملStratification and domination in graphs with minimum degree two
A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The Fdomination number of a graphG is the minimum number of red vertices ofG in a red-blue colori...
متن کاملImproved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five
An algorithmic upper bound on the domination number γ of graphs in terms of the order n and the minimum degree δ is proved. It is demonstrated that the bound improves best previous bounds for any 5 ≤ δ ≤ 50. In particular, for δ = 5, Xing et al. proved in 2006 that γ ≤ 5n/14 < 0.3572n. This bound is improved to 0.3440n. For δ = 6, Clark et al. in 1998 established γ < 0.3377n, while Biró et al. ...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملtwo-out degree equitable domination in graphs
an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113438