Graph optimisation problems encompass a diverse range of challenges aimed at finding optimal or near‐optimal solutions in networks or graphs. These problems are pivotal in areas such as communication ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

The eigenvalue of a graph is the eigenvalue of its adjacency matrix. A graph G is integral if all of its eigenvalues are integers. In this paper some new classes of integral graphs are constructed.