[math-fun] Different graph question

Find a connected graph of girth 5 (i.e. no loops of size 3 or 4) in which every integer is a vertex, every vertex has the same valence, and every vertex is part of a loop of size 5. Yes, I have a solution, unless I'm confused. As usual, I'll give it in a week if I get no solutions or requests for more time.