The diameter of cyclic Kautz digraphs
| dc.contributor.author | Böhmová, Katerina | |
| dc.contributor.author | Dalfó, Cristina | |
| dc.contributor.author | Huemer, Clemens | |
| dc.date.accessioned | 2019-10-10T07:36:18Z | |
| dc.date.available | 2019-10-10T07:36:18Z | |
| dc.date.issued | 2017 | |
| dc.date.updated | 2019-10-10T07:36:18Z | |
| dc.description.abstract | We 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.sponsorship | Research 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.mimetype | application/pdf | |
| dc.identifier.doi | https://doi.org/10.2298/FIL1720551B | |
| dc.identifier.idgrec | 027998 | |
| dc.identifier.issn | 0354-5180 | |
| dc.identifier.uri | http://hdl.handle.net/10459.1/66757 | |
| dc.language.iso | eng | |
| dc.publisher | Faculty of Sciences and Mathematics, University of Nis, Serbia | |
| dc.relation | info: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.isformatof | Versió postprint del document publicat a: https://doi.org/10.2298/FIL1720551B | |
| dc.relation.ispartof | Filomat, 2017, vol. 31, núm. 20, p. 6551-6560 | |
| dc.relation.projectID | info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT | |
| dc.rights | cc-by-nc-nd (c) Böhmová, Katerina et al., 2017 | |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/deed.ca | |
| dc.subject | Digraph | |
| dc.subject | Diameter | |
| dc.subject | Kautz digraph | |
| dc.title | The diameter of cyclic Kautz digraphs | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type.version | acceptedVersion |