Timeline for How to sum products of weights of vertices of graph by edges?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 16, 2020 at 16:58 | history | suggested | JimN | CC BY-SA 4.0 |
fixed spelling mistakes, typos, and grammar
|
| Sep 16, 2020 at 16:37 | review | Suggested edits | |||
| S Sep 16, 2020 at 16:58 | |||||
| Sep 6, 2017 at 12:30 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 7, 2017 at 11:58 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 8, 2017 at 11:22 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 8, 2017 at 10:33 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 9, 2017 at 10:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| S Apr 9, 2017 at 8:15 | history | suggested | Amir Sagiv | CC BY-SA 3.0 |
title+English edits
|
| Apr 9, 2017 at 7:51 | review | Suggested edits | |||
| S Apr 9, 2017 at 8:15 | |||||
| Apr 9, 2017 at 4:39 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 10, 2017 at 3:54 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 8, 2017 at 8:10 | comment | added | Ben Barber | Your matrix $A$ is usually called the adjacency matrix, with "incidence matrix" reserved for the $V \times E$ matrix with $1$s where the vertex $v$ is in the edge $e$ (the edge is incident on the vertex). Your sum is $w^tAw$, assuming $(u,v)$ and $(v,u)$ count as distinct edges; otherwise, provided your graph has no loops, you need to divide by $2$. | |
| Feb 8, 2017 at 2:56 | history | edited | Radmir | CC BY-SA 3.0 |
added 192 characters in body
|
| Feb 7, 2017 at 22:59 | answer | added | Stella Biderman | timeline score: 1 | |
| Feb 7, 2017 at 20:42 | history | asked | Radmir | CC BY-SA 3.0 |