Proof of the strong conjecture about -irregular graphs in the class of graphs of diameter
arXiv:2602.23227
Abstract
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 . According to the strong conjecture about -irregular graphs (Dovzhenok, Filuta, Chuhai), for any connected graph of order , there exist infinitely many -irregular graphs. In the present paper, the strong conjecture about -irregular graphs is confirmed in the class of graphs of diameter . It is proved that for every graph of diameter , there exists an infinite series of -irregular graphs of diameter .