Timeline for Graphs with adjacency matrix depending on associated-vector distances
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2019 at 21:45 | answer | added | Mike | timeline score: 3 | |
| Apr 24, 2019 at 19:12 | comment | added | j.s. | @Timothy Budd. No. | |
| Apr 24, 2019 at 15:35 | history | edited | j.s. | CC BY-SA 4.0 |
deleted 222 characters in body
|
| Apr 24, 2019 at 14:07 | history | edited | j.s. | CC BY-SA 4.0 |
added 341 characters in body
|
| Apr 24, 2019 at 13:06 | comment | added | Timothy Budd | Is there any particular reason you take the vectors $f_v$, $g_v$ to have the same number of components as the order $n$ of the graph? | |
| Apr 24, 2019 at 11:33 | comment | added | LSpice | I changed your title to something more informative. If I didn't capture the idea, then please feel free to change it again, but preferably still to something more informative than the original. | |
| Apr 24, 2019 at 11:32 | history | edited | LSpice | CC BY-SA 4.0 |
Changed title
|
| Apr 24, 2019 at 11:08 | history | edited | j.s. | CC BY-SA 4.0 |
added 421 characters in body
|
| Apr 24, 2019 at 10:54 | history | edited | j.s. | CC BY-SA 4.0 |
[Edit removed during grace period]
|
| S Apr 23, 2019 at 23:49 | history | suggested | David G. Stork | CC BY-SA 4.0 |
corrected English errors
|
| Apr 23, 2019 at 23:18 | review | Suggested edits | |||
| S Apr 23, 2019 at 23:49 | |||||
| Apr 23, 2019 at 19:12 | history | edited | j.s. | CC BY-SA 4.0 |
added 4 characters in body
|
| Apr 23, 2019 at 16:49 | history | asked | j.s. | CC BY-SA 4.0 |