Some results about independent sets and independent dominating sets on the strong product of graphs and its applications (CROSBI ID 512827)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Klobučar, Antoaneta
engleski
Some results about independent sets and independent dominating sets on the strong product of graphs and its applications
This paper presents a review of my results on the independent sets and independent dominating sets on the strong product of two paths, two cycles and path and cycle. Independent sets were introduced into the communication theory on noisy channels. A noisy channel consists of transmission alphabet T and receiving alphabet R, and the information about what letters of T can be received as what letters of R. Confusion graph C has vertices which are elements of T, and two vertices are adjacent if and only if they can be received as the same letter. If we have two noisy channels with confusion graphs C_1 and C_2 and consider strings of length two with the first element coming from the first alphabet and the second from the second alphabet, then the new confusion graph is the strong product C_1 C_2.
independent dominating sets; strong product of graphs
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
17-23.
2005.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the 10th International Conference on Operational Research - KOI 2004
Scitovski, Rudolf ; Jukić, Dragan
Osijek: Odjel za matematiku Sveučilišta Josipa Jurja Strossmayera u Osijeku
Podaci o skupu
10th International Conference on Operational Research KOI 2004
predavanje
22.09.2005-24.09.2005
Trogir, Hrvatska