Edge-domatic number of a graph
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity:
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity:
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
The edge-domatic number of a graph is the maximum number of classes of a partition of its edge set into dominating sets. This number is studied for cacti, i.e. graphs in which each edge belongs to at most one circuit.
Bohdan Zelinka (1991)
Mathematica Bohemica
Similarity:
The total edge-domatic number of a graph is introduced as an edge analogue of the total domatic number. Its values are studied for some special classes of graphs. The concept of totally edge-domatically full graph is introduced and investigated.
Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let k ≥ 1 be an integer, and G = (V, E) be a finite and simple graph. The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and all edges having a common end-vertex with e. A signed Roman edge k-dominating function (SREkDF) on a graph G is a function f : E → {−1, 1, 2} satisfying the conditions that (i) for every edge e of G, ∑x∈NG[e] f(x) ≥ k and (ii) every edge e for which f(e) = −1 is adjacent to at least one edge e′ for which f(e′) = 2. The minimum of...
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: