An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph

Sayed Mohammad Hosseini, Mahdi Davoudi Darareh, Shahrooz Janbaz +1

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cd…