Timeline for Is there a standard term for this graph/set theoretic concept?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2017 at 20:07 | comment | added | Vinicius dos Santos | No, because when you take the transitive closure of the adjacency relation you get a reachability relation or, as you said, a relation that tells you whether two vertices belong to the same connected component. | |
| Sep 17, 2017 at 16:43 | comment | added | Bjørn Kjos-Hanssen | So... transitive adjacency does not tell you when two vertices are adjacent. | |
| Sep 17, 2017 at 11:11 | comment | added | Vinicius dos Santos | In the traditional graph interpretation, yes. | |
| Sep 17, 2017 at 5:46 | comment | added | Bjørn Kjos-Hanssen | But adjacent means connected by 1 edge of the graph, right? | |
| Sep 16, 2017 at 13:53 | comment | added | Vinicius dos Santos | Exactly. That's another way of stating it. | |
| Sep 16, 2017 at 6:17 | comment | added | Bjørn Kjos-Hanssen | I guess transitive adjacency tells you when two vertices are in the same connected component. | |
| Sep 16, 2017 at 2:43 | history | edited | Vinicius dos Santos | CC BY-SA 3.0 |
Typo
|
| Sep 10, 2017 at 7:59 | vote | accept | Aryeh Kontorovich | ||
| Oct 21, 2016 at 11:29 | comment | added | Aryeh Kontorovich | Thanks! Since asking the question, it's looking like I won't be needing this concept after all -- at least not for now :) | |
| Oct 21, 2016 at 1:07 | history | answered | Vinicius dos Santos | CC BY-SA 3.0 |