Mostrar el registro sencillo del ítem

dc.contributor.authorKuziak, Dorota 
dc.contributor.authorPeterin, Iztok
dc.contributor.authorGonzález Yero, Ismael 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2024-02-08T14:43:58Z
dc.date.available2024-02-08T14:43:58Z
dc.date.issued2014-03-01
dc.identifier.issn1365-8050
dc.identifier.urihttp://hdl.handle.net/10498/30894
dc.description.abstractA 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 establishedes_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceDiscrete Mathematics and Theoretical Computer Science - 2014, Vol.16 n.1 pp. 105–120.es_ES
dc.subjectefficient open dominationes_ES
dc.subjectgraph productses_ES
dc.subjecttotal dominationes_ES
dc.titleEfficient open domination in graph productses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.46298/dmtcs.1267
dc.type.hasVersionAMes_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional