Cargando…
Presentations for vertex-transitive graphs
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex-transitive graph.
Autores principales: | Georgakopoulos, Agelos, Wendland, Alex |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9075864/ https://www.ncbi.nlm.nih.gov/pubmed/35535236 http://dx.doi.org/10.1007/s10801-021-01070-6 |
Ejemplares similares
-
The planar cubic Cayley graphs
por: Georgakopoulos, Agelos
Publicado: (2018) -
Cycle decompositions: From graphs to continua
por: Georgakopoulos, Agelos
Publicado: (2012) -
Hyperbolicity vs. Amenability for Planar Graphs
por: Federici, Bruno, et al.
Publicado: (2017) -
Vertex Deletion into Bipartite Permutation Graphs
por: Bożyk, Łukasz, et al.
Publicado: (2022) -
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
por: Tee, Philip, et al.
Publicado: (2018)