In this paper we investigate the nature of both the \(2\)-packing number and the minimum domination number of the cartesian product of graphs where at least one of them has the property that every vertex is either a leaf or has at least one leaf as a neighbour.