Is there a name for the class of graphs $G$ with the following property? * Every two graphs that can be created by removing one edge from $G$ are isomorphic.