Go to the content (press return)

# FUTUR. Website for the scientific production of UPC researchers

## The diameter of cyclic Kautz digraphs

Author
Böhmová, K.; Dalfo, C.; Huemer, C.
Type of activity
Journal article
Journal
Filomat
Date of publication
2017
Volume
31
Number
20
First page
6551
Last page
6560
DOI
https://doi.org/10.2298/FIL1720551B
Project funding
Combinatorics of networks and computation
GRUP DE RECERCA EN GEOMETRIA COMPUTACIONAL I MATEMÀTICA DISCRETA. 2014SGR46.
Geometry and graphs: interactions and applications
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Repository
http://hdl.handle.net/2117/116461
URL
http://www.pmf.ni.ac.rs/pmf/publikacije/filomat/2017/31-20/31-20-28-4422.pdf
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...
Citation
Böhmová, K., Dalfo, C., Huemer, C. The diameter of cyclic Kautz digraphs. "Filomat", 2017, vol. 31, núm. 20, p. 6551-6560.
Keywords
Kautz digraph, diameter, digraph
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry