3 papers
math.CO2026
From roots to paths: graphs simultaneously irregular with respect to rooted and ordinary paths
Tatiana Dovzhenok
Let denote a path on vertices. A simple finite graph is called -irregular if any two distinct vertices of belong to a different number of subgraphs of is…
math.CO2026
Proof of the strong conjecture about -irregular graphs in the class of graphs of diameter
Tatiana Dovzhenok
Let and be simple finite undirected graphs. A graph is called -irregular if any two of its distinct vertices belong to different numbers of copies of in . Acc…
math.CO2025
On -irregular oriented graphs
Tatiana Dovzhenok, Ilya Lukashenko, Yahor Filiuta
Let and be simple finite oriented graphs (without symmetric arcs). A graph is called -irregular if any two distinct vertices in belong to a different number of s…