On $\overrightarrow{C_{n}}$-irregular oriented graphs

Read full text
Authors: Tatiana Dovzhenok, Ilya Lukashenko, Yahor Filiuta
Cited by: 0

Abstract

First Online 2026 UDC 519.17 MSC: 05C07, 05C20, 05C35, 05C38 https://doi.org/10.21538/0134-4889-2026-32-4-fon-01 Full Text T.S. Dovzhenok, I.D. Lukashenko, Y.V. Filiuta. On $\overrightarrow{C_{n}}$-irregular oriented graphs. 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

Fields of Study & Subjects

Graph Labeling and Dimension Problems Finite Group Theory Research Advanced Graph Theory Research

Publication details

Journal / source
Trudy Instituta Matematiki i Mekhaniki UrO RAN
Publisher
Krasovskii Institute of Mathematics and Mechanics UB RAS
Volume
32
Issue
4
Publication date
12 May 2026