On $\overrightarrow{C_n}$-irregular oriented graphs

Tatiana Dovzhenok, Ilya Lukashenko, Yahor Filiuta

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of s…