Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

Quantifying the differences between networks is a challenging and ever-present problem in network science. In recent years, a multitude of diverse, ad hoc solutions to this problem have been ...

Let G be a graph. The splitting graph SP(G) of G is the graph received from G by putting a new vertex w′ for each w ∈ VG and joining w′ to all vertices of G adjacent to w. Let SG be the set of such ...

Distance-time graphs show how the distance travelled by a moving object changes with time. These graphs also show if the object is moving at a constant speed or accelerating, going back to the ...

Real life situations such as travelling over time and across distance can be drawn on a graph. Exact distances and times are plotted on the graph. These are shown as co-ordinates. These points are ...

Chemical graph theory provides a rigorous framework for representing molecular structures as graphs, where vertices denote atoms and edges represent bonds. This mathematical abstraction facilitates ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...