1 problem

Let $C_n$ be a cycle on $n$ vertices, and let $C_n^d$ be its $d$th power: two distinct vertices are adjacent when their distance in $C_n$ is at most $d$. The rna number $c3^{-}(G)$…