Results 21 to 30 of about 897 (158)

Strong in-domatic number in digraphs [PDF]

, 2022
Let $D=(V,A)$ be a digraph and $\mathfrak{S}$ a partition of $V(D)$. We say that $\mathfrak{S}$ is a strong in-domatic partition if every $S$ in $\mathfrak{S}$ holds that every vertex not in $S$ has at least one out-neighbor in $S$, that is $S$ is an in-dominating set, and $D\langle S \rangle$ is strongly connected.
Laura Pastrana-Ramírez, Rocío Sánchez-López, Miguel Tecpa-Galván   +2 more
openalex   +3 more sources

Total k-rainbow Domatic Number [PDF]

International Journal of Science and Research (IJSR), 2022
Pavitra P. Kumbargoudra, Shailaja S. Shirkol   +1 more
openalex   +2 more sources

Signed star k-domatic number of a graph

Contributions to Discrete Mathematics, 2011
Let G be a simple graph without isolated vertices with vertex set V(G) and edge set E(G) and let k be a positive integer. A function f:E(G)⟶{−1,1} is said to be a signed star k-dominating function on G if ∑e∈E(v)f(e)≥k for every vertex v of G, where E(v)={uv∈E(G)∣u∈N(v)}.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 more
openalex   +5 more sources

Refining the Sox10^Dom/+ mouse model: A new breeding strategy with relevance to Hirschsprung disease genetics. [PDF]

Animal Model Exp Med
This study optimized the breeding strategy for Sox10Dom/+ mice, enhancing research efficiency. By self‐breeding the progeny B6C3Fe‐g, resulting from the cross of B6C3Fe Sox10Dom/+ males with C57BL/6J females, it was found to have a higher number of offspring and greater survival rates compared to the B6C3Fe strain, while maintaining genetic and ...
Lan C, Chen J, Huang S, Mu Y, Wang Q, Zhong X, Tang N, Zhao X, Lu J, Wu Y, Huang L, Zeng J, Zhong W, Ouyang Y, He Q, Zhang Y.   +15 more
europepmc   +2 more sources

Maximum Degree Vertex Domatic Set Algorithm for Domatic Number Problem [PDF]

Journal of the Korea Society of Computer and Information, 2015
Sang-Un Lee
openalex   +3 more sources

On upper domatic number of graphs [PDF]

arXiv admin note: text overlap with arXiv:2408 ...
Subhabrata Paul, Kamal Santra
openalex   +3 more sources

The Domatic Partition Problem in Separable Graphs

Mathematics, 2022
The domatic partition problem consists of partitioning a given graph into a maximum number of disjoint dominating sets. This problem is related with the domatic number problem, which consists of quantifying this maximum number of disjoint dominating sets.
Mercedes Landete, José Luis Sainz-Pardo
doaj   +1 more source

A note on the Roman domatic number of a digraph [PDF]

Communications in Combinatorics and Optimization, 2020
A {\em Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling $f\colon V(D)\to \{0, 1, 2\}$ such that every vertex with label $0$ has an in-neighbor with label $2$. A set $\{f_1,f_2,\ldots,f_d\}$ of Roman dominating functions
Lutz Volkmann, D. Meierling
doaj   +1 more source

Connected Domatic Number in Planar Graphs [PDF]

Czechoslovak Mathematical Journal, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hartnell, Bert L., Rall, Douglas F.
openaire   +1 more source

On Domatic and Total Domatic Numbers of Product Graphs

, 2021
A \emph{domatic} (\emph{total domatic}) \emph{$k$-coloring} of a graph $G$ is an assignment of $k$ colors to the vertices of $G$ such that each vertex contains vertices of all $k$ colors in its closed neighborhood (neighborhood). The \emph{domatic} (\emph{total domatic}) \emph{number} of $G$, denoted $d(G)$ ($d_t (G)$), is the maximum $k$ for which $G$
Francis, P., Rajendraprasad, Deepak
openaire   +2 more sources