A domination graph of a digraph D , dom(D)dom(D), is created using the vertex set of D and edge {u,v}∈E[dom(D)]{u,v}∈E[dom(D)] whenever (u,z)∈A(D)(u,z)∈A(D) or (v,z)∈A(D)(v,z)∈A(D) for every other vertex z∈V(D)z∈V(D). The underlying graph of a digraph DD, UG(D)UG(D), is the graph for which D is a biorientation. We completely characterize digraphs whose underlying graphs are identical to their domination graphs, UG(D)=dom(D)UG(D)=dom(D). The maximum and minimum number of single arcs in these digraphs, and their characteristics, is given
This paper presents the application of domination in digraph which is useful in designing a graph mo...
Abstract. If D = (V, A) is a digraph, its domination hypergraph DH(D) = (V, E) has the vertex set V...
The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) ...
A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,v}∈E[dom...
AbstractA domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,...
A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an e...
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (do...
A domination graph of a digraph D, dom(D), is created using the vertex set of D, V (D). There is an ...
Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for ...
AbstractAn out-domination set of a digraph D is a set S of vertices of D such that every vertex of D...
AbstractWe generalize the concept of efficient total domination from graphs to digraphs. An efficien...
The domination graph of a digraph has the same vertices as the digraph with an edge between two vert...
The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integr...
summary:The domatic numbers of a graph $G$ and of its complement $\bar{G}$ were studied by J. E. Du...
AbstractAn (h,k)-dominating set in a digraph G is a subset D of V(G) such that the subdigraph induce...
This paper presents the application of domination in digraph which is useful in designing a graph mo...
Abstract. If D = (V, A) is a digraph, its domination hypergraph DH(D) = (V, E) has the vertex set V...
The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) ...
A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,v}∈E[dom...
AbstractA domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u,...
A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an e...
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (do...
A domination graph of a digraph D, dom(D), is created using the vertex set of D, V (D). There is an ...
Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for ...
AbstractAn out-domination set of a digraph D is a set S of vertices of D such that every vertex of D...
AbstractWe generalize the concept of efficient total domination from graphs to digraphs. An efficien...
The domination graph of a digraph has the same vertices as the digraph with an edge between two vert...
The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integr...
summary:The domatic numbers of a graph $G$ and of its complement $\bar{G}$ were studied by J. E. Du...
AbstractAn (h,k)-dominating set in a digraph G is a subset D of V(G) such that the subdigraph induce...
This paper presents the application of domination in digraph which is useful in designing a graph mo...
Abstract. If D = (V, A) is a digraph, its domination hypergraph DH(D) = (V, E) has the vertex set V...
The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) ...
Add to ORKG