Properties of mixed Moore graphs of directed degree one

dc.contributor.authorLópez Lorenzo, Ignacio
dc.contributor.authorPujolàs Boix, Jordi
dc.date.accessioned2015-02-10T13:56:33Z
dc.date.embargoEndDate2025-01-01
dc.date.issued2015-04-01
dc.date.updated2015-02-10T13:56:33Z
dc.description.abstractMixed graphs of order n such that for any pair of vertices there is a unique trail of length at most k between them are known as mixed Moore graphs. These extremal graphs may only exist for diameter k = 2 and certain (infinitely many) values of n. In this paper we give some properties of mixed Moore graphs of directed degree one and reduce their existence to the existence of some (undirected) strongly regular graphs.
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1016/j.disc.2014.11.009
dc.identifier.idgrec021981
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/10459.1/47913
dc.language.isoeng
dc.publisherElsevier
dc.relation.isformatofReproducció del document publicat a: https://doi.org/10.1016/j.disc.2014.11.009
dc.relation.ispartofDiscrete Mathematics, 2015, num. 338, p. 522-526
dc.rights(c) Elsevier, 2015
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectMoore bound
dc.subjectMixed Moore graph
dc.subjectDirected strongly regular graph
dc.subject.classificationTeoria de grafs
dc.subject.otherGraph theory
dc.titleProperties of mixed Moore graphs of directed degree one
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
021981.pdf
Size:
400.91 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: