summary:The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the $n$-dimensional cube $Q_n$
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
AbstractWe study three recently introduced numerical invariants of graphs, namely, the signed domina...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
The signed edge domination number and the signed total edge domination number of a graph are conside...
AbstractLet γs′(G) (γl′(G), resp.) be the number of (local) signed edge domination of a graph G [B. ...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
Throughout this paper we initiate a new definition of edge domination in graphs that is called whole...
AbstractLet γs′(G) be the signed edge domination number of G. In 2006, Xu conjectured that: for any ...
summary:The signed total domination number of a graph is a certain variant of the domination number....
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
AbstractWe give sharp upper bounds on the upper signed domination number of nearly regular graphs an...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the...
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
AbstractWe study three recently introduced numerical invariants of graphs, namely, the signed domina...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
summary:The signed edge domination number and the signed total edge domination number of a graph are...
The signed edge domination number and the signed total edge domination number of a graph are conside...
AbstractLet γs′(G) (γl′(G), resp.) be the number of (local) signed edge domination of a graph G [B. ...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
Throughout this paper we initiate a new definition of edge domination in graphs that is called whole...
AbstractLet γs′(G) be the signed edge domination number of G. In 2006, Xu conjectured that: for any ...
summary:The signed total domination number of a graph is a certain variant of the domination number....
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
AbstractWe give sharp upper bounds on the upper signed domination number of nearly regular graphs an...
summary:The open neighborhood $N_G(e)$ of an edge $e$ in a graph $G$ is the set consisting of all ed...
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the...
AbstractLet G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V ...
AbstractWe study three recently introduced numerical invariants of graphs, namely, the signed domina...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
DOI
Add to ORKG