Add to ORKGTyt. z nagł.References p.10.Dostępny również w formie drukowanej.ABSTRACT: Dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree. The tree domatic number of G is the maximum number of pairwise disjoint tree dominating sets in V(G). First, some exact values of and sharp bounds for the tree domatic number are given. Then, we establish a sharp lower bound for the number of edges in a connected graph of given order and given tree domatic number, and we characterize the extremal graphs. Finally, we show that a tree domatic number of a planar graph is at most 4 and give a characterization of planar graphs with the tree domatic number 3. KEYWORDS: tree domatic number, regular graph, planar graph, carte...
In a graph G, a vertex is said to dominate itself and all its neighbors. A dominating set of a graph...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
A dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree...
summary:A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connect...
A dominating set of a graph G = ( P’, E) is a subset D of Vsuch that every vertex not in D is adjace...
AbstractA dominating set of a graph G = (V,E) is a subset D of V such that every vertex not in D is ...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
Domination is a well-known graph theoretic concept due to its significant real-world applications in...
A domatic partition of a graph GH = (V, E) is a partition of V into disjoint sets V1,V2, …Vk such th...
Abstract. An edge dominating set of a graph is a set of edges D such that every edge not in D is adj...
summary:The domination number and the domatic number of a certain special type of Kneser graphs are ...
AbstractAn edge dominating set in a graph G is a set of edges D such that every edge not in D is adj...
AbstractA subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex o...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
In a graph G, a vertex is said to dominate itself and all its neighbors. A dominating set of a graph...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...
A dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree...
summary:A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connect...
A dominating set of a graph G = ( P’, E) is a subset D of Vsuch that every vertex not in D is adjace...
AbstractA dominating set of a graph G = (V,E) is a subset D of V such that every vertex not in D is ...
summary:Let $k$ be a positive integer, and let $G$ be a simple graph with vertex set $V(G)$. A {\it ...
Domination is a well-known graph theoretic concept due to its significant real-world applications in...
A domatic partition of a graph GH = (V, E) is a partition of V into disjoint sets V1,V2, …Vk such th...
Abstract. An edge dominating set of a graph is a set of edges D such that every edge not in D is adj...
summary:The domination number and the domatic number of a certain special type of Kneser graphs are ...
AbstractAn edge dominating set in a graph G is a set of edges D such that every edge not in D is adj...
AbstractA subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex o...
AbstractThe reinforcement number of a graph is the smallest number of edges that have to be added to...
In a graph G, a vertex is said to dominate itself and all its neighbors. A dominating set of a graph...
summary:A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called point-set dominating, if for ...
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent t...