In this work, we describe regular domination set (RDS) and dominating number λR (G) in FG study some charateristics bounds of several FG's.

Abstract A graph is l -reconstructible if it determined by its multiset of induced subgraphs obtained deleting vertices. We prove that 3-regular graphs are 2-reconstructible.