Show simple item record

dc.contributor.authorKlavžar, Sandi
dc.contributor.authorKuziak, Dorota 
dc.contributor.authorGonzález Yero, Ismael 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.contributor.otherMatemáticases_ES
dc.date.accessioned2023-10-02T12:45:51Z
dc.date.available2023-10-02T12:45:51Z
dc.date.issued2022-12-31
dc.identifier.issn1422-6383
dc.identifier.urihttp://hdl.handle.net/10498/29371
dc.description.abstractThe outer multiset dimension dim ms(G) of a graph G is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that dim ms(G) = n(G) - 1 if and only if G is a regular graph with diameter at most 2. Graphs G with dim ms(G) = 2 are described and recognized in polynomial time. A lower bound on the lexicographic product of G and H is proved when H is complete or edgeless, and the extremal graphs are determined. It is proved that dimms(Ps□Pt)=3 for s≥ t≥ 2.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherSpringeres_ES
dc.rightsAtribución 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceResults in Mathematics. vol, 78, nº 2, April 2023, 50es_ES
dc.subjectgridses_ES
dc.subjectlexicographic product of graphses_ES
dc.subjectouter multiset dimensiones_ES
dc.subjectOuter multiset resolving setes_ES
dc.titleFurther Contributions on the Outer Multiset Dimension of Graphses_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.description.physDesc15 páginases_ES
dc.identifier.doi10.1007/s00025-022-01829-8
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-105824GB-I00/ES/OPTIMIZACION MATEMATICA Y COMBINATORIA EN REDES/ es_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/UCA//EST2022-075es_ES
dc.type.hasVersionVoRes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución 4.0 Internacional
This work is under a Creative Commons License Atribución 4.0 Internacional