Show simple item record

dc.contributor.authorDalfó, Cristina
dc.date.accessioned2019-01-31T14:42:36Z
dc.date.available2019-01-31T14:42:36Z
dc.date.issued2018
dc.identifier.issn0219-2659
dc.identifier.urihttp://hdl.handle.net/10459.1/65691
dc.description.abstractKautz digraphs K(d, l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, l) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family of subKautz digraphs sK(d, l), from where the cyclic Kautz digraphs can be obtained as line digraphs. This allows us to give exact formulas for the distance between any two vertices of both sK(d, l) and CK(d, l). Moreover, we compute the diameter and the semigirth of both families, also providing efficient routing algorithms to find the shortest path between any pair of vertices. Using these parameters, we also prove that sK(d, l) and CK(d, l) are maximally vertex-connected and super-edge-connected. Whereas K(d, `) are optimal with respect to the diameter, we show that sK(d, l) and CK(d, l) are optimal with respect to the mean distance, whose exact values are given for both families when l = 3. Finally, we provide a lower bound on the girth of CK(d, l and sK(d, l).ca_ES
dc.description.sponsorshipThis research is supported by MINECO under project MTM2014-60127-P, and the Catalan Research Council under project 2014SGR1147. This research has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 734922.ca_ES
dc.language.isoengca_ES
dc.publisherWorld Scientific Publishingca_ES
dc.relationMINECO/PN2013-2016/MTM2014-60127-Pca_ES
dc.relation.isformatofVersió preprint del document publicat a https://doi.org/10.1142/S0219265918500068ca_ES
dc.relation.ispartofJournal of Interconnection Networks, 2018, vol. 18, núm. 02n03, p. 1850006ca_ES
dc.rights(c) World Scientific Publishing, 2018ca_ES
dc.subjectDigraphca_ES
dc.subjectDistanceca_ES
dc.subjectDiameterca_ES
dc.titleFrom Subkautz Digraphs to Cyclic Kautz Digraphsca_ES
dc.typeinfo:eu-repo/semantics/articleca_ES
dc.identifier.idgrec028090
dc.type.versioninfo:eu-repo/semantics/submittedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca_ES
dc.identifier.doihttps://doi.org/10.1142/S0219265918500068
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECTca_ES


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record