On the total domatic number of regular graphs
WebThe fractional domatic number of a graph G is the maximum ratio F /m(F) over all families F of dominating sets of G, where m(F) denotes the maximum number of times an element appears in F . The fractional idiomatic and fractional total domatic numbers are defined analogously with F all families of independent dominating sets and total dominating sets … WebG is the signed (k,k)-domatic number of G, denoted by dk S(G). First we study basic properties of dk S(G). Some of them are extensions of well-known results on the signed domatic number dS(G) = d1 S(G) given in [6]. Using these results, we determine the signed (k,k)-domatic numbers of fans, wheels and grids. 2. Basic properties of the signed (k ...
On the total domatic number of regular graphs
Did you know?
Web19 de mar. de 2024 · In this paper, we show that for two non-trivial graphs $G$ and $H$, the domatic and total domatic numbers of their Cartesian product $G \cart H$ is … Web15 de set. de 2024 · For regular graphs with higher minimum degree, we have the following lower bound on the fractional total domatic number of a regular graph. Theorem 31 ([ 16 ]) For all k ≥ 3 , if G is a k-regular graph, then
Webclass of regular graphs whose vertices are impossible to be decomposed into two total dominating sets. It is briefly ... which is an open problem. Cubic Graphs with Total Domatic Number at Least Two 77 Since coloring and partitioning are essentially the same, the total domination has also been studied in the literature of graph coloring under ... WebRegular total domatically full graphs are also called rainbow graphs (see, [27, 29]). We first make some easy observations on rainbow graphs. Examples of rainbow graphs …
WebThe fractional domatic number of a graph G is the maximum ratio F /m(F) over all families F of dominating sets of G, where m(F) denotes the maximum number of times an … WebIn this section we prove that for all cubic regular graphs, having no subgraph isomorphic to L (given in Figure 1), the total domatic number is at least two. Figure 1: The graph L Theorem 2. The vertex set of a cubic graph can be partitioned into two total dominating sets if it has no subgraph (not necessarily induced) isomorphic to the graph L.
WebIn this paper we shall study the domatic number, the total domatic number and the connected domatic number of cubic graphs, i. e. regular graphs of degree 3. We …
http://www.math.clemson.edu/~calkin/Papers/calkin_dankelmann.pdf literallynooneWebThe concept of domatic number and total domatic number was introduced by Cockayne etal.,in[10]and[9]respectively,andinvestigatedfurtherin[1,2,5,8,12,18,24,26,32,33]. In [33], Zelinka have shown the existence of graphs with very large minimum degree have a total domatic number 1. Chen et al., [8] and Goddard and Henning [12] have studied literallynobot discordWebتعداد نشریات: 44: تعداد شمارهها: 1,460: تعداد مقالات: 11,915: تعداد مشاهده مقاله: 21,843,664: تعداد ... literally nicked waterproof visionWeb1 de abr. de 2006 · In this paper, we define the signed total domatic number of a graph in an analogous way to that of the fractional domatic number defined by D. F. Rall [Congr. … literallynoone lyricsWebThe domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular graph is almost surely at most r, and that for 3-regular random graphs, the domatic number is almost surely equal to 3. literallynoone fnf wikiWebIn graph theory, a domatic partition of a graph = (,) is a partition of into disjoint sets , ,..., such that each V i is a dominating set for G.The figure on the right shows a domatic partition of a graph; here the dominating set consists of the yellow vertices, consists of the green vertices, and consists of the blue vertices.. The domatic number is the maximum … importance of headwater streamsWeb14 de set. de 2010 · The total {. k. }-domatic number of a graph. For a positive integer k, a total { k }- dominating function of a graph G is a function f from the vertex set V ( G) to the set {0,1,2,…, k } such that for any vertex v ∈ V ( G ), the condition ∑ u∈N(v) f ( u )≥ k is fulfilled, where N ( v) is the open neighborhood of v. importance of head nursing