Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in ...

Abstract Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families ...

The field of graph theory has been around since 1736, when Leonhard Euler published an article on the subject of the Seven Bridges of Königsberg (in Prussia, today’s Kaliningrad in Russia).

The recent past has seen an increasing interest in Heterogeneous Graph Neural Networks (HGNNs), since many real-world graphs are heterogeneous in nature, from citation graphs to email graphs. However, ...

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We ...

In theory, it cannot be ruled out that the algorithms might run for longer than the age of the universe. But in practice, many algorithms seem to work just fine.

The book is intended to appeal to a broad audience. KALAMAZOO, Mich.—Western Michigan University's international reputation on the topic of graph theory is on display in a new book published recently ...