Small Trivalent Graphs of Large Girth

Conder, M

dc.contributor.author	Conder, M	en
dc.date.accessioned	2009-04-16T23:18:12Z	en
dc.date.available	2009-04-16T23:18:12Z	en
dc.date.issued	1997-06	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-042 (1997)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3551	en
dc.description.abstract	Definitions are given for seven trivalent Cayley graphs, of girths 17; 18; 20; 21; 22; 23 and 24. At the time of writing (June 1997) each of these is the smallest known trivalent graph of the corresponding girth.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Small Trivalent Graphs of Large Girth	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en