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 ...

Let d₁ ≥ d₂ ≥ ··· ≥ dn be the degree sequence of a graph G of order n and μ₁ ≥ μ₂ ≥ ··· ≥ μn = 0 be the Laplacian eigenvalues of G. In this paper, we propose a new conjecture that for any graph G ...

Some strange mathematical sequences are always whole numbers — until they’re not. The puzzling patterns have revealed ties to graph theory and prime numbers, awing mathematicians. Simple, yes, but ...