COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Junior Algebra/Logic/Number Theory seminar > Some Classes of Generalized Graph Groups

## Some Classes of Generalized Graph GroupsAdd to your list(s) Download to your calendar using vCal - Mehmet Sefa Cihan, University of Essex
- Friday 25 October 2019, 15:00-16:00
- CMS, MR13.
If you have a question about this talk, please contact Liam Jolliffe. In this talk, we will provide an overview of results in generalised graph groups, for graphs with |V|=|A|-1 (where |V| is the number of vertices and |A| is the number of arcs), and Circulant digraphs. This talk will turn its attention to prove whether these corresponding groups of the possible graphs under |V|=|A|-1 are finite cyclic group or not. In some cases we are able to show that they are finite cyclic group (22 of 31 possible graphs), in others that the rank is at least 1 or 2. We will also demonstrate the order of these groups. In terms of Circulant digraphs, we will give the exact order for generalised graph groups corresponding to Circulant digraphs. This talk is part of the Junior Algebra/Logic/Number Theory seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- CMS, MR13
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Junior Algebra/Logic/Number Theory seminar
- School of Physical Sciences
- bld31
- ndb35's list
Note that ex-directory lists are not shown. |
## Other listsHow People Really Make Medical Decisions: The Problem of the Patient Microsoft Research Computational Science Seminars Quantum Tricritical Points in NbFe2## Other talksStatistics Clinic Michaelmas 2019 - II The Political Economy of Serfdom: State Capacity and Institutional Change in Prussia and Russia New prospects in numerical relativity Commanding Nature in Early Modern Europe (Domestication Practices across History) Finite element exterior calculus as a tool for compatible discretizations Putting Infinity on the Grid |