Is there a name for the class of finite graphs $G$ with the following property?
- Every two graphs that can be created by removing one edge from $G$ are isomorphic.
(Edited to add the word "finite.")
Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
Milligram
- 13
- 3