Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The diameter of cyclic Kautz digraphs

Autor
Böhmová, K.; Dalfo, C.; Huemer, C.
Tipus d'activitat
Article en revista
Revista
Filomat
Data de publicació
2017
Volum
31
Número
20
Pàgina inicial
6551
Pàgina final
6560
DOI
https://doi.org/10.2298/FIL1720551B Obrir en finestra nova
Projecte finançador
Combinatorics of networks and computation
GRUP DE RECERCA EN GEOMETRIA COMPUTACIONAL I MATEMÀTICA DISCRETA. 2014SGR46.
Grafos y geometría: interacciones y aplicaciones
Tecnicas de optimizacion en teoria de grafos, grupos y combinatoria. aplicaciones a redes, algoritmos y protocolos de comunicacion.
Repositori
http://hdl.handle.net/2117/116461 Obrir en finestra nova
URL
http://www.pmf.ni.ac.rs/pmf/publikacije/filomat/2017/31-20/31-20-28-4422.pdf Obrir en finestra nova
Resum
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...
Citació
Böhmová, K., Dalfo, C., Huemer, C. The diameter of cyclic Kautz digraphs. "Filomat", 2017, vol. 31, núm. 20, p. 6551-6560.
Paraules clau
Diameter, Digraph, Kautz Digraph
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants