Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

This lecture course is devoted to the study of random geometrical objects and structures. Among the most prominent models are random polytopes, random tessellations, particle processes and random ...

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

Let 𝐺 = (𝑉,𝐸), 𝑉={1,2,...,𝑛}, be a simple connected graph of order𝑛, size 𝑚 with vertex degree sequence 𝑑1 ≥ 𝑑2 ≥ ... ≥ 𝑑𝑛 > 0, 𝑑𝑖 = 𝑑(𝜐𝑖). The geometric–arithmetic topological index ...