Mostrar el registro sencillo del ítem

dc.contributor.authorKelenc, Aleksander
dc.contributor.authorKuziak, Dorota 
dc.contributor.authorTaranenko, Andrej
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:17:54Z
dc.date.available2024-02-08T14:17:54Z
dc.date.issued2017-12-01
dc.identifier.issn0096-3003
dc.identifier.urihttp://hdl.handle.net/10498/30889
dc.description.abstractLet $G=(V,E)$ be a connected graph. A vertex $w\in V$ distinguishes two elements (vertices or edges) $x,y\in E\cup V$ if $d_G(w,x)\ne d_G(w,y)$. A set $S$ of vertices in a connected graph $G$ is a mixed metric generator for $G$ if every two elements (vertices or edges) of $G$ are distinguished by some vertex of $S$. The smallest cardinality of a mixed metric generator for $G$ is called the mixed metric dimension and is denoted by $\mdim(G)$. In this paper we consider the structure of mixed metric generators and characterize graphs for which the mixed metric dimension equals the trivial lower and upper bounds. We also give results about the mixed metric dimension of some families of graphs and present an upper bound with respect to the girth of a graph. Finally, we prove that the problem of determining the mixed metric dimension of a graph is NP-hard in the general case.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceApplied Mathematics and Computation - 2017, Vol. 314 pp. 429–438es_ES
dc.subjectmixed metric dimensiones_ES
dc.subjectedge metric dimensiones_ES
dc.subjectmetric dimensiones_ES
dc.titleMixed metric dimension of graphses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/j.amc.2017.07.027
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