Timeline for Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2011 at 23:39 | vote | accept | Milligram | ||
| Oct 17, 2010 at 12:43 | comment | added | Milligram | 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$. | |
| Oct 17, 2010 at 12:41 | history | edited | Milligram | CC BY-SA 2.5 |
added 45 characters in body
|
| Oct 17, 2010 at 12:01 | answer | added | Gjergji Zaimi | timeline score: 7 | |
| Oct 17, 2010 at 11:44 | comment | added | sleepless in beantown | or does it mean that $G$ is a connected graph with connectivity strength such that removing any single edge disconnects it into two separate component connected graphs, which are then isomorphic to each other? What's the motivation behind this problem? Is this part of a home-work problem set? | |
| Oct 17, 2010 at 11:41 | comment | added | sleepless in beantown | If there are only two graphs that can be created by removing one edge from $G$, then $G$ is a graph with only two edges? Do you mean to say "every graph that can be created by removing one edge from $G$ is isomorphic... to every other such graph"? | |
| Oct 17, 2010 at 11:22 | answer | added | Pete L. Clark | timeline score: 3 | |
| Oct 17, 2010 at 11:21 | answer | added | Bhalchandra D Thatte | timeline score: 2 | |
| Oct 17, 2010 at 10:18 | answer | added | Gerry Myerson | timeline score: 2 | |
| Oct 17, 2010 at 10:12 | history | asked | Milligram | CC BY-SA 2.5 |