Large Cayley Graphs and Digraphs with Small Degree and Diameter

Hafner, P.R

dc.contributor.author	Hafner, P.R	en
dc.date.accessioned	2009-04-16T23:16:00Z	en
dc.date.available	2009-04-16T23:16:00Z	en
dc.date.issued	1995-06	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-004 (1995)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3513	en
dc.description.abstract	We review the status of the Degree/Diameter problem for both, graphs and digraphs and present new Cayley digraphs which yield improvements over some of the previously known largest vertex transitive digraphs of given degree and diameter.	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	Large Cayley Graphs and Digraphs with Small Degree and Diameter	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