Grafy ako modely sietí s danými metrickými vlastnosťami a danou mierou symetrieSupervisor: 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:||In the study of various models of communication networks by means of graph theory one often encounters restrictions on vertex degrees and on the diameter (or girth) of the corresponding graphs, with emphasis on extremal orders subject to the given constraints. A particular role in networks with extremly large number of nodes is played by highly symmetric models,which in the čase of number of vertices in the order of millions significantľy facilitates the investigation. The objective of the proposed project is to study graphs of a given level of symmetry as possible network models with vertices of the samé given degree which, subject to a given diameter (or girth), háve the largest (or the smallest) number of vertices.|
|Kind of project:||APVV - Všeobecná výzva ()|
|Department:||Department of Mathematics and Constructive Geometry (FCE)|
|Project status:||In process of execution|
|Project start date :||01. 10. 2013|
|Project close date:||30. 09. 2017|
|Number of workers in the project:||2|
|Number of official workers in the project:||0|