  From a research of several recent papers, in the first part, we are concerned
with domination number in cubic graphs and give a sufficient condition of
Reed's conjecture. In the second part, from a perspective, we study the
structure of a minimum dominating set in 3-connected graphs. It is derived from
a collection of cycles with length 0 mod 3.
