Results 11 to 20 of about 896 (158)
Some new results on the b-domatic number of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 A domatic partition P of a graph G=(V,E) is a partition of V into classes that are pairwise disjoint dominating sets. Such a partition P is called b-maximal if no larger domatic partition P' can be obtained by gathering subsets of some classes of P to ...
Mohamed Benattalah +2 more
doaj +2 more sources
The Italian domatic number of a digraph [PDF]
Communications in Combinatorics and Optimization, 2019 An {\em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function $f\colon V(D)\to \{0, 1, 2\}$ such that every vertex $v\in V(D)$ with $f(v)=0$ has at least two in-neighbors assigned 1 under $f$ or one in-neighbor ...
L.Volkmann
doaj +2 more sources
Strong domatic number of a graph [PDF]
Discrete Mathematics, Algorithms and Applications, 2023 A set [Formula: see text] of vertices of a simple graph [Formula: see text] is a strong dominating set, if for every vertex [Formula: see text] there is a vertex [Formula: see text] with [Formula: see text] and [Formula: see text]. The strong domination number [Formula: see text] is defined as the minimum cardinality of a strong dominating set.
Nima Ghanbari, Saeid Alikhani
openalex +3 more sources
Vertex-Domatic, Edge-Domatic and Total Domatic Number of Uniform Hypergraphs [PDF]
, 2020 Submitted to "Information Processing Letters, Elsevier"
Smruti Dash
openalex +3 more sources
On the b-Domatic Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition 𝒫 of G is called b-
Benatallah Mohammed +2 more
doaj +2 more sources
Upper Bounds on the Signed Total (K, K)-Domatic Number of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and Σx∈N(v) f(x) ≥ k for each v ∈ V (G), where N(v) is the neighborhood of v, then f is a signed total k-dominating function on G. A set {
Volkmann Lutz
doaj +2 more sources
The Numerical Invariants concerning the Total Domination for Generalized Petersen Graphs
Journal of Mathematics, 2020 A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to a vertex in S. The total domination number of a graph G denoted by γtG is the minimum cardinality of a total dominating set in G.
Taiyin Zhao +4 more
doaj +2 more sources
Edge-domatic number of a graph [PDF]
Czechoslovak Mathematical Journal, 1983 An edge-dominating set of a graph G is a subset D of the edge set E(G) with the property that for each edge \(e\in E(G)-D\) there exists at least one edge \(f\in D\) adjacent to e. The maximum number of classes of partitions of E(G) into edge-dominating sets is called the edge-domatic number of G and is denoted by ed(G).
Bohdan Zelinka
openalex +2 more sources
REGULAR PARTIAL DOMATIC NUMBER ON ANTI FUZZY GRAPHS [PDF]
Journal of Mechanics of Continua and Mathematical SciencesAG = (N, A, σ, μ) be a anti fuzzy graph. A partition of N(AG) Π = {D1, D2, …., Dk} is a regular anti fuzzy partial domatic partition of AG if (i) for each Di, < Di > is an anti fuzzy regular and (ii) Di is an anti fuzzy dominating set of GA.
Rengasamy Muthuraj +2 more
doaj +2 more sources
The Signed Total Roman k-Domatic Number Of A Graph
Discussiones Mathematicae Graph Theory, 2017 Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +2 more sources