(okay, I'm not learning math in english, so please don't be harsh with me for not using the correct terminology here, but I hope you can understand my problem. also feel free to correct me)
Find a connected graph for every $n\geq4$ , for which is true, that his adjacency matrix on every power consists at least one(probably will consist 2) $0$. (where $n$ is the quantity of the vertices).