Timeline for About the diameter of a graph after removing orientation
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2014 at 9:37 | comment | added | Hebert | Thanks a lot Gerhard. I was just thinking about that construction too. These constructions are very useful examples. However, they are not even regular, let alone vertex-transitive. My impression is that in a vertex-transitive graph these extremal situations cannot occur. I would like to confirm or reject that. | |
| Jul 5, 2014 at 21:12 | comment | added | Gerhard Paseman | A similar construction on n ordered points (all edges decreasing except for (i,i+1) ) gives a directed path from 1 to n of length n-1, with the unoriented version being a complete graph of diameter 1. Gerhard "Likes One Downing The Competition" Paseman, 2014.07.05 | |
| Jul 5, 2014 at 21:01 | history | edited | user126154 | CC BY-SA 3.0 |
added 2 characters in body
|
| Jul 5, 2014 at 21:00 | comment | added | user126154 | yes, you're right, corrected | |
| Jul 5, 2014 at 10:09 | comment | added | Hebert | Well, the oriented diameter should be $n-1$, isn't it? | |
| Jul 5, 2014 at 0:45 | history | answered | user126154 | CC BY-SA 3.0 |