Timeline for Does the notion of graphs with vertex multiplicity exist?
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 23, 2022 at 18:58 | comment | added | The Amplitwist | The link to Borchmann's diploma thesis in a comment above is broken, but it can be found now at iccl.inf.tu-dresden.de/w/images/8/81/Orbifolds.pdf. | |
| Oct 1, 2013 at 17:39 | answer | added | David Eppstein | timeline score: 2 | |
| Oct 1, 2013 at 16:46 | answer | added | Andrew D. King | timeline score: 4 | |
| Sep 19, 2013 at 8:51 | comment | added | Martin Rubey | This is also a special case of the "generalized lexicographic product of graphs", also known as "local join" or "composition" $G[H_1,H_2,\dots,H_n]$ where the $H_i$ consist of isolated vertices only. See eg. Sabidussi, "Graph derivatives" or item 16 of Section 2.7 in Cvetkovic, Doob, Sachs, "Spectra of Graphs". | |
| Sep 19, 2013 at 8:49 | vote | accept | Aline Parreau | ||
| Sep 19, 2013 at 8:49 | vote | accept | Aline Parreau | ||
| Sep 19, 2013 at 8:49 | |||||
| Sep 19, 2013 at 8:49 | vote | accept | Aline Parreau | ||
| Sep 19, 2013 at 8:49 | |||||
| Sep 19, 2013 at 2:14 | answer | added | Timothy Chow | timeline score: 2 | |
| Sep 18, 2013 at 22:45 | answer | added | Flo Pfender | timeline score: 8 | |
| Sep 18, 2013 at 22:22 | comment | added | Tobias Schlemmer | A similar construction has been called binary relation orbifold (Borchmann, Daniel: Context Orbifolds, Diploma Thesis, TU Dresden, 2009, link). | |
| Sep 18, 2013 at 13:23 | answer | added | Ira Gessel | timeline score: 0 | |
| Sep 18, 2013 at 10:16 | answer | added | Felix Goldberg | timeline score: 1 | |
| Sep 18, 2013 at 9:49 | comment | added | HJRW | It's heavily used in subsequent work on outer automorphisms of graph groups. Look at the citations of Servatius' paper. The reference is: H. Servatius, Automorphisms of graph groups, J. Algebra 126 (1989), no. 1, 34–60. | |
| Sep 18, 2013 at 9:32 | answer | added | Tony Huynh | timeline score: 0 | |
| Sep 18, 2013 at 9:16 | comment | added | Aline Parreau | Indeed, the equivalence classes with this relation will be either clique or stable sets. Do you know if anyone else use this relation and the reduced graph behind ? | |
| Sep 18, 2013 at 8:57 | comment | added | HJRW | A similar but not identical equivalence relation was defined by Servatius in his study of graph groups (aka right-angled Artin groups). Write $u\geq v$ if $N(v)\subseteq N(u)\cup\{u\}$ and $u\sim v$ if $u\geq v$ and $v\geq u$. In other words, $u$ and $v$ are also allowed to be adjacent. | |
| Sep 18, 2013 at 8:50 | review | First posts | |||
| Sep 18, 2013 at 8:57 | |||||
| Sep 18, 2013 at 8:33 | history | asked | Aline Parreau | CC BY-SA 3.0 |