نتایج جستجو برای: minus domination in graphs
تعداد نتایج: 17005600 فیلتر نتایج به سال:
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs total domination critical or just γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We study an open problem of ...
This paper deals the graphs for which the removal of any edge changes the majority domination number of the graph. γM -critical edges, γM -redundant edges, γM -durable graphs and γM -critical graphs are studied. Further, majority domination critical edges and majority domination critical graphs are characterized.
a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$. the total domination number of a graph $g$, denoted by $gamma_t(g)$, is~the minimum cardinality of a total dominating set of $g$. chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004), 6...
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar graphs of diameter four having arbitrarily large domination numbers. In this paper we improve on their results. We prove that there is in fact a uni...
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with arbitrarily large domination numbers are constructed for which this bound is attained. Concerning the upper domination number we prove that Γ(G × H) ≥ Γ(G)Γ(H), thus confirming a conjecture from [16]. Finally, for paired-domi...
Abstract A set of vertices in a graph is dominating if every vertex or adjacent to . If, addition, an independent set, then set. The domination number the minimum cardinality , while We prove that for all integers it holds connected ‐regular graph, with equality and only result was previously known This affirmatively answers question Babikir Henning.
In this paper, we introduce the closed domination in graphs. Some interesting relationships are known between domination and closed domination and between closed domination and the independent domination. It is also shown that any triple m, k and n of positive integers with 3 ≤ m ≤ k ≤ n are realizable as the domination number, closed domination number and independent domination number, respect...
The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید