Results 21 to 30 of about 896 (158)
On the total domatic number of regular graphs [PDF]
Transactions on Combinatorics, 2012 A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S.
H. Aram +2 more
doaj +3 more sources
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 +2 more
openalex +3 more sources
Total k-rainbow Domatic Number [PDF]
International Journal of Science and Research (IJSR), 2022 Pavitra P. Kumbargoudra +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)}.
Maryam Atapour +1 more
openalex +5 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
Crystal Structure of Gd(Ca3.319Sr0.681)O[BO3]3 and Gd(Ca2.592Sr1.408)O[BO3]3
Crystal Research and Technology, Volume 58, Issue 5, May 2023., 2023 The presented work shows the results of chemical modification with different substituents of a the rare‐earth calcium oxoborates RCa2Ca2O[BO3]3 and discusses challenges of the growth process. Two new phases of RCa2Ca2O[BO3]3 with single substitution of Sr phases on the Ca site are synthesized and structure models including the cation disorder are ...
Tina Weigel +5 more
wiley +1 more source