Bakı Dövlət Universiteti Digital Research Lab

In this talk, he connects several notions relating to the structural and dynamical properties of a graph.

Among them are the topological entropy coming from a certain dynamical system, which is related to the spectral radius of the graph’s adjacency matrix, the Randić index from chemistry, and the degree assortativity of real networks. He will demonstrate that a hierarchical structure from computer science, known as breadth-first search ordering with decreasing degrees, characterizes the maximization of these notions.