dc.contributor.advisor |
Conder, M |
en |
dc.contributor.author |
Poznanovic, Nemanja |
en |
dc.date.accessioned |
2016-09-12T23:19:36Z |
en |
dc.date.issued |
2016 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/30316 |
en |
dc.description |
Full text is available to authenticated members of The University of Auckland only. |
en |
dc.description.abstract |
The arc-type of a vertex-transitive graph is a partition of the graph's valency as a sum of the lengths of the orbits of a vertex-stabiliser on the neighbourhood of that vertex, with parentheses used in this partition to denote paired orbits. It has been shown by Conder, Pisanski and Zitnik that every arc-type except for 2 = 1+1 and 2 = (1+1) is realised by some vertex-transitive graph [8]. We extend their theorem by showing that every arc-type other than 1, 1+1 and (1+1) is realised by infinitely many connected finite Cayley graphs. |
en |
dc.publisher |
ResearchSpace@Auckland |
en |
dc.relation.ispartof |
Masters Thesis - University of Auckland |
en |
dc.relation.isreferencedby |
UoA99264878797202091 |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights |
Restricted Item. Available to authenticated members of The University of Auckland. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.rights.uri |
http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ |
en |
dc.title |
Cayley Graphs with given Arc-Type |
en |
dc.type |
Thesis |
en |
thesis.degree.discipline |
Mathematics |
en |
thesis.degree.grantor |
The University of Auckland |
en |
thesis.degree.level |
Masters |
en |
dc.rights.holder |
Copyright: The author |
en |
pubs.elements-id |
541112 |
en |
pubs.record-created-at-source-date |
2016-09-13 |
en |
dc.identifier.wikidata |
Q112926274 |
|