Let H and D be two digraphs; D without loops or multiple arcs. An H −coloring of D is a function ρ : A(D) → V (H). We say that D is an (H, ρ)−colored digraph. For an arc (x, y) of D, we say that ρ(x, y) is the color of (x, y) over the H −coloring ρ. A directed path (x 1 ,. .. , x n) in D is an (H, ρ)−path if (ρ(x 1 , x 2),. .. , ρ(x n−1 , x n)) is a directed walk in H. An (H, ρ)−kernel in an (H, ρ)−colored digraph is a subset of vertices of D, say S, such that for every pair of different vertices in S there is no (H, ρ)−path between them and every vertex outside S can reach S by an (H, ρ)−path. A digraph D is an H-panchromatic digraph if D has an (H, ρ)−kernel for every digraph H and every H −coloring ρ of D. In this paper we show that H-panchromatic digraphs cannot be characterized by means of certain forbidden subdigraphs. Also we will show H-panchromaticity of some classes of digraphs and we show that H-panchromaticity can be hereditary in some operations of digraphs.

Let D = (V, A) be a digraph and S a partition of V (D). We say that S is a strong in-domatic partition if every S in 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 S is strongly connected. The maximum number of elements in a strong in-domatic partition is called the strong in-domatic number of D and it is denoted by d − s (D). In this paper we introduce those concepts and determine the value of d − s for semicomplete digraphs and planar digraphs. We show some structural properties of digraphs which have a strong in-domatic partition and we see some bounds for d − s (D). Then we study this concept in the Cartesian product, composition, line digraph and other associated digraphs.In addition, we characterize strong in-domatic critical digraphs and we give two families strong in-domatic critical digraphs which hold some properties, where a strong in-domatic critical digraph D holds that d − s (D − e) = d − s (D) − 1 for every e in A(D).

Let D ¼ ðVðDÞ, AðDÞÞ be a digraph and S a subset of vertices of D, S is an absorbent set if for every v in VðDÞ n S there exists a vertex u in S such that ðv, uÞ 2 AðDÞ: A subset S of V(D) is a semicomplete absorbent set if S is absorbent and the induced subdigraph DhSi is semicomplete. The minimum (respectively maximum) of the cardinalities of the semicomplete absorbent sets is the lower (respectively upper) semicomplete absorbent number, denoted by c sas ðDÞ (respectively C sas ðDÞ). In this paper we introduce the concept of semicomplete absorbent set; we will show some structural properties on the digraphs which have a semicomplete absorbent set and we will present some bounds for c sas ðDÞ and C sas ðDÞ: Then we will study the Cartesian product, the composition of digraphs and the line digraph in relation with those numbers.

No abstract

No abstract