A signed edge domination function (or SEDF) of a simple graph G=(V, E) is a function f:
E→{1,− 1} such that∑ e′∈ N [e] f (e′)≥ 1 holds for each edge e∈ E, where N [e] is the …

In this paper, a study has been started on a new variation of the problem on signed roman
domination called signed roman star edge dominance problem. A mapping g: E→{− 1, 1, 2} …

Signed Edge Total Domination on Rooted Product Graphs Page 1 Annals of Pure and
Applied Mathematics Vol. 17, No. 1, 2018, 95-99 ISSN: 2279-087X (P), 2279-0888(online) …

Abstract Let G=(V, E) be an undirected graph with vertex set V and edge set E. The open
neighborhood N (e) of an edge e∈ E is the set of all edges adjacent to e. The closed …

Let $ G $ be a simple graph with $ n $ vertices and $\pm 1$-weights on edges. Suppose that
for every edge $ e $ the sum of edges adjacent to $ e $(including $ e $ itself) is positive …

Let γ S′(G) and γ SS (G) be the signed edge domination number and signed star
domination number of a graph G, respectively. In this paper, we prove that for a tree T of …

We briefly review known results about the signed edge domination number of graphs. In the
case of bipartite graphs, the signed edge domination number can be viewed in terms of its bi …

图号下 Page 1 第3 期 2011 年5 月 华东师范大学学报(自然科学版) Journal of East China Normal
University (Natural Science) No. 3 May 2011 文号: 1000-5641(2011)03-0040-04 图号下 1, 2 …

For a graph G=(V, E) without isolated vertex, a function f: E (G)→− 1, 1 is said to be a signed
star dominating function of G ∑ e ∈ E (v) f (e) ≥ 1 for every v∈ V (G), where E (v)= uv∈ E …

Let GG be a graph with the vertex set V (G) V (G) and the edge set E (G) E (G). A function f: E
(G) ⟶ {-1, 1\} f: E (G)⟶-1, 1 is said to be a signed star dominating function of GG if ∑ _ e ∈ …