For non-negative integers~$k$, we consider graphs in which every vertex has exactly $k$ vertices at distance~$2$, i.e., whose distance-$2$ are $k$-regular. We call such $k$-metamour-regular motivated by the terminology polyamory. While constructing is relatively easy -- provide a generic construction for arbitrary~$k$ finding all much more challenging. show that only with certain property canno...