Timeline for Strongly connected graph and the eigenvalues of the laplacian matrix
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2015 at 21:43 | vote | accept | MarcosDNMaia | ||
| Oct 26, 2015 at 9:13 | history | edited | MarcosDNMaia | CC BY-SA 3.0 |
added 175 characters in body
|
| Oct 26, 2015 at 9:07 | comment | added | MarcosDNMaia | Brendan McKay, you are right. The definition in terms of the inner degree is not good. I think the right definition would be: Given any two vertices $i,j$ in $G$ there is always a directed path from $i$ to $j$ and from $j$ to $i$. | |
| Oct 25, 2015 at 22:23 | review | Close votes | |||
| Oct 26, 2015 at 20:57 | |||||
| Oct 25, 2015 at 22:09 | answer | added | Dima Pasechnik | timeline score: 6 | |
| Oct 25, 2015 at 22:03 | comment | added | Brendan McKay | That's not the definition of strong connectivity. | |
| Oct 25, 2015 at 20:24 | history | edited | Stefan Kohl♦ |
Added top-level tag.
|
|
| Oct 25, 2015 at 20:07 | review | First posts | |||
| Oct 25, 2015 at 20:24 | |||||
| Oct 25, 2015 at 20:04 | history | asked | MarcosDNMaia | CC BY-SA 3.0 |