Domination Number in 4-Regular Graphs (Report)
International Journal of Mathematical Combinatorics 2010, Jan, 4
-
- 2,99 €
-
- 2,99 €
Description de l’éditeur
[section] 1. Introduction Throughout this paper, all graphs considered are finite, undirected, loopless and without multiple edges. We refer the reader to [11] for terminology in graph theory.