A finite connected graph is called canonical if no two of its vertices have the same neighbours. In this paper we prove that in all but a sequence of exceptional cases, deleting of a suitable chosen vertex in a canonical graph also gives a connected canonical graph. This property can have applications in various hereditary problems in the spectral Theory of Graphs.