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
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2010 at 22:45 | comment | added | Gerry Myerson | FWIW, OP now adds that only finite graphs are of interest. | |
| Oct 17, 2010 at 20:58 | comment | added | Pete L. Clark | @MF: Yes, that will also work. I don't know if your graph is "much simpler" than mine, but it is indubitably locally finite and planar, which is nice. As for your final question: you might consider posting it here... | |
| Oct 17, 2010 at 20:32 | comment | added | Matt Fayers | Isn't there a much simpler example: take G to be the union of countably many isolated vertices, countably many paths with one edge, and countably many paths with two edges? A harder question: is there an example in which the edge-deleted graphs are isomorphic to each other but not to the original graph? | |
| Oct 17, 2010 at 11:41 | history | edited | Pete L. Clark | CC BY-SA 2.5 |
added 164 characters in body
|
| Oct 17, 2010 at 11:35 | history | edited | Pete L. Clark | CC BY-SA 2.5 |
added 812 characters in body; added 9 characters in body
|
| Oct 17, 2010 at 11:22 | history | answered | Pete L. Clark | CC BY-SA 2.5 |