Skip to main content
MathOverflow

Return to Question

added 45 characters in body
Source Link
Milligram
Milligram
  • 13
  • 3

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.")

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.

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.")

Source Link
Milligram
Milligram
  • 13
  • 3

Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.

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.