Show simple item record

dc.contributor.authorBöhmová, Katerina
dc.contributor.authorDalfó, Cristina
dc.contributor.authorHuemer, Clemens
dc.date.accessioned2019-10-10T07:36:18Z
dc.date.available2019-10-10T07:36:18Z
dc.date.issued2017
dc.identifier.issn0354-5180
dc.identifier.urihttp://hdl.handle.net/10459.1/66757
dc.description.abstractWe present a new kind of digraphs, called cyclic Kautz digraphs CK(d, ɭ), which are subdigraphs of the well-known Kautz digraphs K(d,ɭ). The latter have the smallest diameter among all digraphs with their number of vertices and degree. Cyclic Kautz digraphs CK(d, ɭ) have vertices labeled by all possible sequences a1 . . . aɭ of length ɭ, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 ≠ aɭ. Their arcs are between vertices a1a2 . . . aɭ and a2 . . . aɭ aɭ + 1, with a1 ≠ aɭ and a2 ≠ aɭ + 1. We give the diameter of CK(d, ɭ) for all the values of d and ɭ, and also its number of vertices and arcs.
dc.description.sponsorshipResearch of C. Dalfo is supported by projects MINECO MTM2014-60127-P, and AGAUR 2014SGR1147. Research of C. Huemer is supported by projects MINECO MTM2015-63791-R, and AGAUR 2014SGR46. C. Dalfo and C. Huemer have also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie SkłodowskaCurie grant agreement No 734922.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherFaculty of Sciences and Mathematics, University of Nis, Serbia
dc.relationinfo:eu-repo/grantAgreement/MINECO//MTM2014-60127-P/ES/TECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBINATORIA. APLICACIONES A REDES, ALGORITMOS Y PROTOCOLOS DE COMUNICACION/
dc.relation.isformatofVersió postprint del document publicat a: https://doi.org/10.2298/FIL1720551B
dc.relation.ispartofFilomat, 2017, vol. 31, núm. 20, p. 6551-6560
dc.rightscc-by-nc-nd (c) Böhmová, Katerina et al., 2017
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/deed.ca
dc.subjectDigraph
dc.subjectDiameter
dc.subjectKautz digraph
dc.titleThe diameter of cyclic Kautz digraphs
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-10-10T07:36:18Z
dc.identifier.idgrec027998
dc.type.versionacceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.2298/FIL1720551B
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Böhmová, Katerina et al., 2017
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Böhmová, Katerina et al., 2017