Add to ORKGAbstract. A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number γ2s (G) and the signed total 2-domination number γ2st(G) of a graph G are variants of the signed domination number γs(G) and the signed total domination number γst(G). Their values for caterpillars are studied
summary:The signed total domination number of a graph is a certain variant of the domination number....
Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respect...
The maximum number of functions in a signed total dominating family on G is the signed total domatic...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
A set D of vertices in a graph G is a 2-dominating set of G if every vertex in V − D has at least tw...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
Let G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
AbstractLet G=(V,E) be a simple graph. For an edge e of G, the closed edge-neighbourhood of e is the...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Abstract: Let G be a finite and simple graph with vertex set V (G), k ≥ 1 an integer and let f: V (G...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
Ph.D.In Chapter 1 we will give a brief historical account of domination theory and define the necess...
summary:The signed total domination number of a graph is a certain variant of the domination number....
Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respect...
The maximum number of functions in a signed total dominating family on G is the signed total domatic...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a...
A set D of vertices in a graph G is a 2-dominating set of G if every vertex in V − D has at least tw...
summary:The signed edge domination number of a graph is an edge variant of the signed domination num...
Let G = (V, E) be a graph. The function f : V(G) → {−1, 1} is a signed dominating function if for ev...
AbstractLet G=(V,E) be a simple graph. For an edge e of G, the closed edge-neighbourhood of e is the...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
Abstract: Let G be a finite and simple graph with vertex set V (G), k ≥ 1 an integer and let f: V (G...
AbstractFor a graph G, a signed domination function of G is a two-colouring of the vertices of G wit...
Abstract. For any integer k ≥ 1, a signed (total) k-dominating function is a function f: V (G) → {−...
Ph.D.In Chapter 1 we will give a brief historical account of domination theory and define the necess...
summary:The signed total domination number of a graph is a certain variant of the domination number....
Let γₜ(G) and γ₂(G) be the total domination number and the 2-domination number of a graph G, respect...
The maximum number of functions in a signed total dominating family on G is the signed total domatic...