𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the difference of the domination number of a digraph and of its reverse

✍ Scribed by Štefan Gyürki

Book ID
113564767
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
270 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The difference between the domination nu
The difference between the domination number and the minus domination number of a cubic graph
✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph

On the domination numbers of generalized
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
✍ Yosuke Kikuchi; Yukio Shibata 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 94 KB

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graph