2 problems

Let $G$ and $H$ be graphs. Their distance degree sequences are the vectors formed by the transmissions of their vertices. Randić's conjecture. The graphs $G$ and $H$ are isomorphic…

Consider extremal and largest known undirected circulant graphs, arranged by degree and diameter, and partition their distance levels into a maximal zone, consisting of the levels…