I've got a graph theory/combinatorics question that I'm really struggling with, and would appreciate some help. The question says:
Suppose $G$ is a graph such that every vertex has degree at most 3, and the shortest path between any two vertices has length at most 2. Show that $G$ has at most 10 vertices, and construct such a graph with 10 vertices.