Let $G=(V(G),E(G))$ be a graph and $H=(V(H),E(H))$ be a hypergraph. The hypergraph $H$ is a {\it Berge-G} if there is a bijection $f : E(G) \mapsto E(H)$ such that for each $e \in E(G)$ we have $e \subseteq f(e)$. We define {\it dilations of $G$} as a particular subfamily of not necessarily uniform Berge-$G$ hypergraphs. We examine domination, matching and transversal numbers and some relation between these parameters in that family of hypergraphs. Our work generalizes previous results concerning generalized power hypergraphs.