Unicontour Isomorphic Factorizations of de Bruijn and Kautz Digraphs

In this paper, we consider the bondage number b(G) for a digraph G, which is defined as the minimum number of edges whose removal results in a new digraph with larger domination number. This parameter measures to some extent the robustness of an ...

A vertex u in a digraph G out-dominates itself and all vertices v such that (u,v) is an arc of G, similarly, u in-dominates both itself and all vertices w such that (w,u) is an arc of G. A set D of vertices of G is a twin dominating set of G if every ...

In a digraph G, a vertex u is said to dominate itself and vertices v such that (u,v) is an arc of G. For a positive integer k, a k-tuple dominating set D of a digraph is a subset of vertices such that every vertex is dominated by at least k vertices in ...