Timeline for Distinct sums for edge weights
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 28, 2019 at 6:45 | review | Close votes | |||
| May 30, 2019 at 16:24 | |||||
| May 28, 2019 at 6:26 | comment | added | Gerry Myerson | I'm voting to close this question as off-topic because OP has abandoned it. | |
| May 2, 2019 at 14:05 | comment | added | Gerry Myerson | Are you still here? | |
| Apr 26, 2019 at 3:28 | comment | added | Gerry Myerson | So there are two nodes with the name $a_0$? | |
| Apr 25, 2019 at 23:47 | comment | added | T. Amdeberhan | Yes, both the value and the name. I was hoping the pictures in the link shade more light into it, if you can view them. | |
| Apr 25, 2019 at 22:32 | comment | added | Gerry Myerson | So, the $a_i$ are both the values of the nodes, and the names of the nodes? And the node named $a_{2n-1}$ is isolated? | |
| Apr 25, 2019 at 18:42 | comment | added | T. Amdeberhan | @GerryMyerson: I've added a few lines to clarify this. | |
| Apr 25, 2019 at 18:41 | history | edited | T. Amdeberhan | CC BY-SA 4.0 |
added 89 characters in body
|
| Apr 25, 2019 at 5:09 | comment | added | Gerry Myerson | ?? If there's an edge connecting $a_i$ and $a_j$ for each $i$ and $j$, then that's not a tree. Can you tell us here what the trees are, instead of making us go offsite to find out? | |
| Apr 24, 2019 at 18:34 | history | asked | T. Amdeberhan | CC BY-SA 4.0 |