Loading...
Loading...

Go to the content (press return)

On cyclic Kautz digraphs

Author
Böhmová, K.; Dalfo, C.; Huemer, C.
Type of activity
Report
Date
2015
Repository
http://hdl.handle.net/2117/80848 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 out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the Kautz digraphs K(d, `). It is well-known that the Kautz digraphs K(d, `) have the smallest diameter am...
Citation
Böhmová, K., Dalfo, C., Huemer, C. "On cyclic Kautz digraphs". 2015.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants

Attachments