On the total domatic number of regular graphs
WebWe show that the total domatic number of a random r -regular graph is almost surely at most r − 1, and that for 3-regular random graphs, the total domatic number is almost surely equal Web28 de abr. de 2011 · The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G, denoted by d t S (G). In this article we …
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 … Webتعداد نشریات: 44: تعداد شمارهها: 1,460: تعداد مقالات: 11,915: تعداد مشاهده مقاله: 21,843,664: تعداد ...
Web1 de mar. de 2012 · We show that the total domatic number of a random r-regular graph is almost surely at most r − 1, and that for 3-regular random graphs, the total domatic number is almost surely equal to 2. We also give a lower bound on the total domatic number of a … Web× Close. The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data.
WebThe total domatic number of a graph G is the maximum number of total dominating sets into which the vertex set of G can be partitioned. We show that the total domatic … Web1 de jun. de 2024 · DOI: 10.22049/CCO.2024.26125.1078 Corpus ID: 55233617; Double Roman domination and domatic numbers of graphs @inproceedings{Volkmann2024DoubleRD, title={Double Roman domination and domatic numbers of graphs}, author={Lutz Volkmann}, year={2024} }
Web20 de fev. de 2024 · The fractional domatic number G is defined as F T D ( G) = sup M M r M. In 2024, Goddard and Henning showed that the incidence graph of every complete k -uniform hypergraph H with order n has F T D ( I ( H)) = n n − k + 1 when n ≥ 2 k ≥ 4. We extend the result to the range n > k ≥ 2.
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 … imperial shih tzu cross puppies for saleWeb28 de jun. de 2011 · Semantic Scholar's Logo liteband 1500http://www.math.clemson.edu/~calkin/Papers/calkin_dankelmann.pdf imperial shih tzu puppies for sale in alabamaWeb11 de jul. de 2024 · The total k-domatic partition problem is to partition the vertices of a graph into k pairwise disjoint total dominating sets. In this paper, we prove that the 4-domatic partition problem is NP-complete for planar graphs of bounded maximum degree. We use this NP-completeness result to show that the total 4-domatic partition problem … imperial shih tzu puppies for sale in njWeb15 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 imperial shih tzus near meWebnumber of a graph, where we partition the vertex set into classes having certain properties (in this case, each class is a dominating set). We consider here the fractional analogue … imperial shipping services indiaWebAbstract: A circulant graph is a Cayley graph constructed out of a finite cyclic group Γ and a generating set A is a subset of Γ. In this paper, we attempt to find upper bounds for distance-g domination, distance-g paired domination and distance-g connected domination number for circulant graphs. Exact values are also determined in certain cases. imperial shih tzu puppies for sale in tn