Timeline for If L is the laplacian matrix of an undirected graph, and D is a diagonal matrix, what does the cofactor of L+D look like?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Aug 20, 2017 at 3:07 | history | suggested | Martin Sleziak | CC BY-SA 3.0 |
added Google Books link
|
| Aug 20, 2017 at 2:31 | review | Suggested edits | |||
| S Aug 20, 2017 at 3:07 | |||||
| Aug 19, 2017 at 2:05 | answer | added | Igor Rivin | timeline score: 1 | |
| S Aug 18, 2017 at 17:36 | history | suggested | Peter Heinig | CC BY-SA 3.0 |
Superficial edits; added reference for the correct and well-known claim in the first sentence. Meaning and style preserved. Question seems rather vague and difficult and broad, in that 'How' and 'change' are intuitive terms.
|
| Aug 18, 2017 at 17:33 | comment | added | Peter Heinig | To point out an obvious thing: because of (Laplacian) + (diagonalmatrix with the negated vertex degrees on the diagonal) = (-adjacencymatrix), and since the cofactors of (-adjacencymatrix) equal the cofactors of the adjacencymatrix itself, this question is at least as difficult as asking: What can appreciably be said in general about cofactors of adjacency matrices of undirected graphs? This seems difficult and not to have been done. | |
| Aug 18, 2017 at 17:27 | review | Suggested edits | |||
| S Aug 18, 2017 at 17:36 | |||||
| Jun 28, 2014 at 4:16 | history | edited | user54452 | CC BY-SA 3.0 |
deleted 61 characters in body
|
| Jun 28, 2014 at 4:15 | history | undeleted | user54452 | ||
| Jun 28, 2014 at 4:14 | history | deleted | user54452 | via Vote | |
| Jun 28, 2014 at 0:06 | review | First posts | |||
| Jun 28, 2014 at 0:10 | |||||
| Jun 27, 2014 at 23:48 | history | asked | user54452 | CC BY-SA 3.0 |