| Title: | On the Roman domination in the lexicographic product of graphs |
|---|
| Authors: | ID Kraner Šumenjak, Tadeja (Author)
ID Repolusk, Polona (Author)
ID Tepeh, Aleksandra (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/j.dam.2012.04.008
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FKBV - Faculty of Agriculture and Life Sciences
|
|---|
| Abstract: | A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f colon V to {0,1,2}$▫ such that every vertex with ▫$f(v) = 0$▫ is adjacent to some vertex with ▫$f(v) = 2$▫. The Roman domination number of ▫$G$▫ is the minimum of ▫$w(f) = sum_{v in V}f(v)$▫ over all such functions. Using a new concept of the so-called dominating couple we establish the Roman domination number of the lexicographic product of graphs. We also characterize Roman graphs among the lexicographic product of graphs. |
|---|
| Keywords: | teorija grafov, rimska dominacija, popolna dominacija, leksikografski produkt, graph theory, Roman domination, total domination, lexicographic product |
|---|
| Year of publishing: | 2012 |
|---|
| Number of pages: | str. 2030-2036 |
|---|
| Numbering: | Letn. 160, iss. 13-14 |
|---|
| PID: | 20.500.12556/DKUM-51429  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0166-218X |
|---|
| COBISS.SI-ID: | 3345708 |
|---|
| NUK URN: | URN:SI:UM:DK:INAOVOTJ |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 2132 |
|---|
| Downloads: | 118 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
