Mostrar el registro sencillo del ítem
Efficient open domination in graph products
| dc.contributor.author | Kuziak, Dorota | |
| dc.contributor.author | Peterin, Iztok | |
| dc.contributor.author | González Yero, Ismael | |
| dc.contributor.other | Estadística e Investigación Operativa | es_ES |
| dc.contributor.other | Matemáticas | es_ES |
| dc.date.accessioned | 2024-02-08T14:43:58Z | |
| dc.date.available | 2024-02-08T14:43:58Z | |
| dc.date.issued | 2014-03-01 | |
| dc.identifier.issn | 1365-8050 | |
| dc.identifier.uri | http://hdl.handle.net/10498/30894 | |
| dc.description.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$. A connection with total domination number is also established | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.source | Discrete Mathematics and Theoretical Computer Science - 2014, Vol.16 n.1 pp. 105–120. | es_ES |
| dc.subject | efficient open domination | es_ES |
| dc.subject | graph products | es_ES |
| dc.subject | total domination | es_ES |
| dc.title | Efficient open domination in graph products | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.46298/dmtcs.1267 | |
| dc.type.hasVersion | AM | es_ES |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
Artículos Científicos [12009]
-
Articulos Científicos Est. I.O. [361]
-
Articulos Científicos Matemáticas [517]
