Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARIS

Graphs and telecommunication networks

Edit
Research activity

Code Science Field Subfield
1.01.00  Natural sciences and mathematics  Mathematics   

Code Science Field
P001  Natural sciences and mathematics  Mathematics 
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
Keywords
telecommunication networks, graph theory, graph labellings
Evaluation (rules)
source: COBISS
Evaluation of bibliographic research performance indicators according to ARIS methodology
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (7)
no. Code Name and surname Research area Role Period No. of publications
1.  17005  PhD Boštjan Brešar  Mathematics  Researcher  2003 - 2004  403 
2.  05949  PhD Sandi Klavžar  Mathematics  Head  2003 - 2005  1,177 
3.  08727  PhD Uroš Milutinović  Mathematics  Researcher  2003 - 2005  348 
4.  20839  PhD Iztok Peterin  Mathematics  Researcher  2005  352 
5.  24904  PhD Simon Špacapan  Mathematics  Researcher  2005  109 
6.  21821  PhD Andrej Taranenko  Mathematics  Researcher  2005  132 
7.  18504  PhD Petra Žigert Pleteršek  Mathematics  Researcher  2003 - 2004  174 
Organisations (1)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,230 
Abstract
We will be working on the following problems where graph theory meets telecommunication networks: visualization of telecommunication networks; search for topologies of fault-tolerant networks; encoding of data which enables error detection and correction, so ensuring reliable data transfer; data routing and search for the shortest paths between nodes of a telecommunication network; the problem of frequencies assignment to radio transmitters. To aid visualization of graphs and discovering their various properties we will develop a software tool in the Java language. The tool will consist of two modules. The first one will be designed for generating and constructing graphs, and will enable various labellings of nodes. The second module will be designed for a graph visualization, including screen projections of graphs described in multidimensional spaces, possibilities for interactive rotating of projected graph, and observing various properties. In the context of data routing in telecommunication networks we will be engaged in research on various important metric and topological properties of graphs. In the area of data encoding with the capability of error detection and correction we plan to consider connections between the Gray codes, state graphs of the generalized towers of Hanoi graphs and their generalizations, the so-called Sierpinski graphs. The problem of frequency assignment to radio transmitters will be treated using graph theory in the case where all the transmitters are of the same type and the signal propagation is isotropic.
Confirmation required
Views history
Favourite