AbstractLet γs′(G) and γss′(G) be the signed edge domination number and signed star domination number of G, respectively. We prove that 2n-4⩾γss′(G)⩾γs′(G)⩾n-m holds for all graphs G without isolated vertices, where n=|V(G)|⩾4 and m=|E(G)|, and pose some problems and conjectures
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
AbstractLet G=(V(G),E(G)) be a graph. A function f:E(G)→{+1,−1} is called the signed edge domination...
AbstractLet γs′(G) (γl′(G), resp.) be the number of (local) signed edge domination of a graph G [B. ...
AbstractLet G=(V,E) be a graph, a function f:E→{−1,1} is said to be an signed cycle dominating funct...
AbstractLet G=(V,E) be a simple graph. For an edge e of G, the closed edge-neighbourhood of e is the...
AbstractLet G be a simple graph without isolated vertex with vertex set V(G) and edge set E(G). A fu...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
AbstractLet γs′(G) be the signed edge domination number of G. In 2006, Xu conjectured that: for any ...
AbstractGiven a graph G=(V,E), if e=uv∈E, then the closed edge-neighbourhood of e is denoted by N[e]...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
AbstractLet G be a finite and simple graph with the vertex set V(G), and let f:V(G)→{−1,1} be a two-...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
AbstractLet G=(V(G),E(G)) be a graph. A function f:E(G)→{+1,−1} is called the signed edge domination...
AbstractLet γs′(G) (γl′(G), resp.) be the number of (local) signed edge domination of a graph G [B. ...
AbstractLet G=(V,E) be a graph, a function f:E→{−1,1} is said to be an signed cycle dominating funct...
AbstractLet G=(V,E) be a simple graph. For an edge e of G, the closed edge-neighbourhood of e is the...
AbstractLet G be a simple graph without isolated vertex with vertex set V(G) and edge set E(G). A fu...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
AbstractLet γs′(G) be the signed edge domination number of G. In 2006, Xu conjectured that: for any ...
AbstractGiven a graph G=(V,E), if e=uv∈E, then the closed edge-neighbourhood of e is denoted by N[e]...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
AbstractLet G be a finite and simple graph with the vertex set V(G), and let f:V(G)→{−1,1} be a two-...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
DOI
Add to ORKG