Graph Theory and its Applications Group
Spectral graph theory, graph entropy, and algebraic combinatorics
The Graph Theory and its Applications Group investigates structural and spectral properties of graphs, with a strong emphasis on real-world modelling and applications. Research spans algebraic and topological aspects of graph theory — including Castelnuovo–Mumford regularity, simplicial complexes, and Laplacian eigenvectors — as well as graph entropy, network assortativity, and hierarchical structures in complex networks.
A distinctive feature of the group’s work is the bridge it builds between pure combinatorics and applied settings, including biochemical network alignment, chemical graph theory, and wireless communication. The group maintains active collaborations with researchers in combinatorial commutative algebra, bioinformatics, and information theory.