Gomel Engineering Institute

Proof of the Strong Conjecture about $$F$$-Irregular Graphs in the Class of Graphs $$\{F\}$$ of Diameter 2

Let $$F$$ and $$G$$ be simple finite undirected graphs. A graph $$G$$ is said to be $$F$$ -irregular if any two of its distinct vertices belong to different numbers of copies of $$F$$ in $$G$$ . According to the strong conjecture about $$F$$ -irregular graphs (Dovzhenok, Filuta,...