Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open neighborhood of e, and (ii) every edge e for which f(e) = −1 is adjacent to at least one edge e′ for which f(e′) = 2. The weight of a signed total Roman edge dominating function f is !(f) = Ʃe∈E f(e). The signed total Roman edge domination number y′stR(G) of G is the minimum weight of a signed total Roman edge dominating function of G. In this paper, we first prove that for every tree T of order n ≥ 4, y′stR(T) ≥ 17−2n/5 and we characterize all extreme trees, and then we present some sharp bounds for the signed total Roman edge domination number. We also determine this parameter for some classes of graphs.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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 the values ∑e∈E f(e), taken over all signed Roman edge k-dominating functions f of G is called the signed Roman edge k-domination number of G, and is denoted by γ′sRk(G). In this paper we initiate the study of the signed Roman edge k-domination in graphs and present some (sharp) bounds for this parameter.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.