Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 224656

Some results about independent sets and independent dominating sets on the strong product of graphs and its applications


Klobučar, Antoaneta
Some results about independent sets and independent dominating sets on the strong product of graphs and its applications // Proceedings of the 10th International Conference on Operational Research - KOI 2004 / Scitovski, Rudolf ; Jukić, Dragan (ur.).
Osijek: Odjel za matematiku Sveučilišta Josipa Jurja Strossmayera u Osijeku, 2005. str. 17-23 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 224656 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Some results about independent sets and independent dominating sets on the strong product of graphs and its applications

Autori
Klobučar, Antoaneta

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
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, 2005, 17-23

Skup
10th International Conference on Operational Research - KOI 2004

Mjesto i datum
Trogir, Hrvatska, 22.09.2004. - 24.09.2004

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
independent dominating sets; strong product of graphs

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Projekti:
0235001

Ustanove:
Sveučilište u Osijeku, Odjel za matematiku

Profili:

Avatar Url Antoaneta Klobučar (autor)


Citiraj ovu publikaciju:

Klobučar, Antoaneta
Some results about independent sets and independent dominating sets on the strong product of graphs and its applications // Proceedings of the 10th International Conference on Operational Research - KOI 2004 / Scitovski, Rudolf ; Jukić, Dragan (ur.).
Osijek: Odjel za matematiku Sveučilišta Josipa Jurja Strossmayera u Osijeku, 2005. str. 17-23 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Klobučar, A. (2005) Some results about independent sets and independent dominating sets on the strong product of graphs and its applications. U: Scitovski, R. & Jukić, D. (ur.)Proceedings of the 10th International Conference on Operational Research - KOI 2004.
@article{article, author = {Klobu\v{c}ar, Antoaneta}, year = {2005}, pages = {17-23}, keywords = {independent dominating sets, strong product of graphs}, title = {Some results about independent sets and independent dominating sets on the strong product of graphs and its applications}, keyword = {independent dominating sets, strong product of graphs}, publisher = {Odjel za matematiku Sveu\v{c}ili\v{s}ta Josipa Jurja Strossmayera u Osijeku}, publisherplace = {Trogir, Hrvatska} }
@article{article, author = {Klobu\v{c}ar, Antoaneta}, year = {2005}, pages = {17-23}, keywords = {independent dominating sets, strong product of graphs}, title = {Some results about independent sets and independent dominating sets on the strong product of graphs and its applications}, keyword = {independent dominating sets, strong product of graphs}, publisher = {Odjel za matematiku Sveu\v{c}ili\v{s}ta Josipa Jurja Strossmayera u Osijeku}, publisherplace = {Trogir, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font