Timeline for Imbalance in a Signed Graph
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 12, 2017 at 8:40 | answer | added | Alon Amit | timeline score: 1 | |
| Jul 12, 2017 at 3:49 | history | migrated | from math.stackexchange.com (revisions) | ||
| Jul 3, 2017 at 14:20 | comment | added | futurebird | Ah that makes more sense. Thanks for clarifying the question. | |
| Jul 3, 2017 at 14:19 | comment | added | BharatRam | @futurebird That is why I graded them in terms of length. There are only finitely many closed paths of a given length $k$. In fact, this number is precisely $Tr(A^k)$ where $A$ is the adjacency matrix. | |
| Jul 3, 2017 at 14:18 | comment | added | BharatRam | @futurebird I have noticed that there seems to be ambiguity in what "path","walk","cycle" etc refer to, and different contexts use slightly different definitions. But in this case, yes. A closed path is simply a sequence of adjacent edges starting and ending at the same vertex. | |
| Jul 3, 2017 at 14:17 | comment | added | futurebird | And if closed paths are cycles with repeated vertices then there are not a finite number in a graph with finite vertices so talking about half of them having any property becomes difficult I think? | |
| Jul 3, 2017 at 14:15 | comment | added | futurebird | Closed paths are just cycles with repeated vertices allowed, yes? | |
| Jul 3, 2017 at 13:33 | history | asked | BharatRam | CC BY-SA 3.0 |