Skip to main content
MathOverflow
Milligram's user avatar
Milligram's user avatar
Milligram's user avatar
Milligram
Unregistered
  • Member for 14 years, 2 months
Profile Activity

7 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Scholar
accepted
Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
awarded
 Student
awarded
 Editor
comment
Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
Sleepless, I aimed at your first choice. Namely, the property is that $G_1$ is isomorphic to $G_2$ whenever $G_1$ is obtained by removing one edge from $G$ and $G_2$ is obtained by removing one edge from $G$.
revised
Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
added 45 characters in body
asked
Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.