نتایج جستجو برای: total domination number
تعداد نتایج: 1835581 فیلتر نتایج به سال:
In this paper, we introduce a new scheme of parameters which generalises many wellknown parameters, including the domination number, the total domination number, the independence number, and the vertex covering number.
A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and G. The global total domination number γgt(G) of G is the minimum cardinality of a GTDS of G. We present bounds for the global total domination number in graphs.
In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for special subclasses of complete multipartite graphs such as cliques and complete bipartite graphs.
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it was shown (J. Graph Theory 40 (2002), 1–25) that a planar graph of diameter three and of radius two has domination number at most six while every sufficiently large planar graph of diameter three has domination number at most seven. In this ...
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. These graphs we call γt-critical. If such a graph G has total domination number k, we call it k-γt-critical. We characterize the connected graphs with minimum degree one t...
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
Let Γ−t (G) be upper minus total domination number of G. In this paper, We establish an upper bound of the upper minus total domination number of a 6-regular graph G and characterize the extremal graphs attaining the bound. Thus, we partially answer an open problem by Yan, Yang and Shan. AMS Subject Classification: 05C69
We give lower and upper bounds on the total domination number of the cross product of two graphs, t (G×H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles.We determine the exact values of t (G×Pn) and t (Cn×Cm)where Pn and Cn denote, respectively, a path and a c...
A subset S of a vertex set of a graphG is a total (k, r)-dominating set if every vertex u ∈ V (G) is within distance k of at least r vertices in S. The minimum cardinality among all total (k, r)-dominating sets ofG is called the total (k, r)domination number of G, denoted by γ (k,r)(G). We previously gave an upper bound on γ t (2,r)(G(n, p)) in random graphs with non-fixed p ∈ (0, 1). In this p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید