Motivation. For any graph $G$, let $L(G)$ denote its line graph. A graph $G$ with $G\cong L(G)$ is said to be line-graph (LG)-invariant. It turns out that the only finite connected LG-invariant graphs are the cycle graphs. In these graphs, all vertices have degree $2$.
Taking this to the infinite. The only (infinite) connected LG-invariant graph that I found with the property that not all vertices have the same degree is
$G = (\mathbb{N}, E)$ where $E = \big\{\{n,n+1\}:n\in\mathbb{N}\big\}$.
Question. Is there $E\subseteq [\mathbb{N}]^2=\big\{\{x,y\}:x\neq y\in\mathbb{N}\big\}$ such that $G=(\mathbb{N},E)$ is connected, LG-invariant, and there is $N_0\in\mathbb{N}$ such that for all $n\in\mathbb{N}$ with $n\geq N_0$ there is a vertex of $G$ with degree $n$?