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

The index of a graph is is the largest eigenvalue of its adjacency matrix. Let Tn,d be the class of trees with n vertices and diameter d. For all integers n and d with 4 ≤ d ≤ n - 3 we identify in ...

The Erdős–Pósa property forms a pivotal concept in modern graph theory by establishing a profound duality between the problems of packing and covering cycles or other substructures. At its core, this ...

I'm wrapping up a discrete math course for my university. The last chapter gave us an introduction to graph theory, and I want to learn more. The chapter in question introduced some basic concepts: ...