Large graphs and communication networks of given degree and diameter.Supervisor: prof. RNDr. Jozef Širáň, DrSc.
This page shows details on the project. The primary projects are displayed together with a list of sub-projects.
|Project description:||The degree-diameter problem, motivated by design of communication network, is to determine the largest numer of vertices in a graph or a digraph with a specified maximum degree and a given diameter and to characterize the corresponding extremal (di)graphs. The main goal of the project is to conduct a large scale investigation of the usage of the covering graph technique to improve the existing constructions of large vertex-transitive and Cayley (di)graphs of given degree and diameter, with possible applications within and outsider of mathematics.|
|Kind of project:||APVV ()|
|Department:||Department of Mathematics and Constructive Geometry (FCE)|
|Project status:||Successfully completed|
|Project start date :||01. 01. 2007|
|Project close date:||31. 12. 2009|
|Number of workers in the project:||1|
|Number of official workers in the project:||0|