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
Presentació treball a congrés
Nom de l'edició
European Conference on Combinatorics, Graph Theory and Applications 2015
Any de l'edició
2015
Data de presentació
2015-09-04
Llibre d'actes
Eurocomb 2015
Repositori
http://hdl.handle.net/2117/85599 Obrir en finestra nova
Resum
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, l) and it is derived from the Kautz digraphs K(d, l). It is well-known that the Kautz digraphs K(d, l) have the smallest diameter among ...
Paraules clau
Kautz Digraphs, Diameter, Line Digraphs, Partial Line Digraphs
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants