Loading...
Loading...

Go to the content (press return)

The diameter of cyclic Kautz digraphs

Author
Böhmová, K.; Dalfo, C.; Huemer, C.
Type of activity
Presentation of work at congresses
Name of edition
European Conference on Combinatorics, Graph Theory and Applications 2015
Date of publication
2015
Presentation's date
2015-09-04
Book of congress proceedings
Eurocomb 2015
Repository
http://hdl.handle.net/2117/85599 Open in new window
Abstract
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 ...
Keywords
Kautz digraphs, diameter, line digraphs, partial line digraphs
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants