Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/58933
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDafik, Mirka Miller, Costas Iliopoulos and Zdenek Ryjacek-
dc.date.accessioned2014-08-17T01:48:14Z-
dc.date.available2014-08-17T01:48:14Z-
dc.date.issued2007-11-05-
dc.identifier.issnProceeding-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/58933-
dc.descriptionYEAR/VOLUME/NUMBER/PAGE:2007/Novemvember 5-9/39-47en_US
dc.description.abstractSince Moore digraphs do not exist for k /= 1 and d /= 1, the problem of finding the existence of digraph of out-degree d >= 2 and diameter k >= 2 and order close to the Moore bound becomes an interesting problem. To prove the non-existence of such digraphs, we first may wish to establish their diregularity. It is easy to show that any digraph with out-degree at most d >= 2, diameter k >= 2 and order n = d + d^2 + ... + d^k-1, that is, two less than Moore bound must have all vertices of out-degree d. However, establishing the regularity or otherwise of the in-degree of such a digraph is not easy. In this paper we prove that all digraphs of defect two are out-regular and almost in-regular.en_US
dc.description.sponsorshipARC Grant 2004-2007 Australiaen_US
dc.language.isoenen_US
dc.publisherThe University of Newcastle Australiaen_US
dc.relation.ispartofseriesThe Eighteenth International Workshop on Combinatorial Algorithms;17-
dc.subjectDiregularity, digraph of defect two, degree-diameter problem.en_US
dc.titleOn diregularity of digraphs of defect twoen_US
dc.typeArticleen_US
Appears in Collections:MIPA

Files in This Item:
File Description SizeFormat 
3On diregularity of digraphs of defect at most two OKOK.pdf1.95 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.