| Title: | Efficient open domination in graph products |
|---|
| Authors: | ID Kuziak, Dorota (Author)
ID Peterin, Iztok (Author)
ID Yero, Ismael G. (Author) |
|---|
| Files: |  Discrete_Mathematics_&_Theoretical_Computer_Science_2014_Kuziak,_Peterin,_Yero_Efficient_open_domination_in_graph_products.pdf (804,78 KB)
MD5: 1B33C012E1F0E1DAB676D3E80ACF1403
PID: 20.500.12556/dkum/f98b3f49-be0e-4cd8-a604-1e699ec0cba1
 http://dmtcs.episciences.org/1267
|
|---|
| Language: | English |
|---|
| Work type: | Scientific work |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| Abstract: | A graph ▫$G$▫ is an efficient open domination graph if there exists a subset ▫$D$▫ of ▫$V(G)$▫ for which the open neighborhoods centered in vertices of ▫$D$▫ form a partition of ▫$V(G)$▫. We completely describe efficient open domination graphs among lexicographic, strong, and disjunctive products of graphs. For the Cartesian product we give a characterization when one factor is ▫$K_2$▫. |
|---|
| Keywords: | graph theory, efficient open domination, graph products, total domination |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Year of publishing: | 2014 |
|---|
| Number of pages: | str. 105-120 |
|---|
| Numbering: | Letn. 16, št. 1 |
|---|
| PID: | 20.500.12556/DKUM-66781  |
|---|
| ISSN: | 1365-8050 |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1365-8050 |
|---|
| COBISS.SI-ID: | 16916057 |
|---|
| NUK URN: | URN:SI:UM:DK:KDTCHMNM |
|---|
| Publication date in DKUM: | 10.07.2017 |
|---|
| Views: | 1550 |
|---|
| Downloads: | 183 |
|---|
| 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. |
