Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

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