Graphs that are basically the same (but perhaps not equal) are called isomorphic. We will give a precise definition of this term after a quick example: