Mostrar el registro sencillo del ítem

The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs

dc.contributor.authorKuziak, Dorota 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2020-10-26T12:02:20Z
dc.date.available2020-10-26T12:02:20Z
dc.date.issued2020-08
dc.identifier.issn2227-7390
dc.identifier.urihttp://hdl.handle.net/10498/23805
dc.description.abstractA vertexwof a connected graphGstrongly resolves two distinct verticesu,v is an element of V(G), if there is a shortestu,wpath containingv, or a shortestv,wpath containingu. A setSof vertices ofGis astrong resolving setforGif every two distinct vertices ofGare strongly resolved by a vertex ofS. The smallest cardinality of a strong resolving set forGis called thestrong metric dimensionofG. To study the strong metric dimension of graphs, a very important role is played by a structure of graphs called the strong resolving graph In this work, we obtain the strong metric dimension of some families of cactus graphs, and along the way, we give several structural properties of the strong resolving graphs of the studied families of cactus graphs.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherMDPIes_ES
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceMathematics 2020, 8(8), 1266es_ES
dc.subjectstrong resolving graphes_ES
dc.subjectstrong metric dimensiones_ES
dc.subjectstrong resolving setes_ES
dc.subjectcactus graphses_ES
dc.subjectunicyclic graphses_ES
dc.titleThe Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.3390/math8081266


Ficheros en el ítem

Nombre:
2020_462.pdf
Tamaño:
288.8Kb
Formato:
PDF

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

Mostrar el registro sencillo del ítem

Atribución 4.0 Internacional
Esta obra está bajo una Licencia Creative Commons Atribución 4.0 Internacional