7 papers
On the existence of -irregular graphs for disconnected graphs
Tatiana Dovzhenok
For a given graph , a graph is -irregular if all its vertices have pairwise distinct -degrees, where the -degree of a vertex is the number of subgraphs of c…
A short note on -irregular graphs
Tatiana Dovzhenok
This note addresses Theorem 12 in the seminal paper ``-degrees in graphs'' by G. Chartrand et al. (1987), which asserts the existence of -irregular graphs for each $n \ge 3…
On infinite families of -irregular graphs
Tatiana Dovzhenok, Ilya Lukashenko, Andrei Mikhalev +1
This paper presents the first systematic study of -irregular graphs, a concept that parallels classical -irregularity. For a fixed graph , a graph is -irregular…
A Complete Proof of the Strong Conjecture about -Irregular Graphs
Tatiana Dovzhenok, Artem Filuta
A graph is called -irregular if all its vertices have distinct -degrees, defined as the number of subgraphs of isomorphic to a given graph and containing the resp…
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…
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…
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…