The diameter of cyclic Kautz digraphs
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 pos...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/116461 |
| Acceso en línea: | https://hdl.handle.net/2117/116461 https://dx.doi.org/10.2298/FIL1720551B |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory digraph diameter Kautz digraph Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | 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à`+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 |
|---|