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

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

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.

Let G be a non-trivial finite group, S ⊆ G \ {e} be a set such that if a ϵ S, then a⁻¹ ϵ S and e be the identity element of G. Suppose that Cay(G, S) is the Cayley graph with the vertex set G such ...