DC FieldValueLanguage
dc.contributor.authorČangalović, Mirjanaen
dc.contributor.authorKratica, Jozefen
dc.contributor.authorKovačević-Vujčić, Veraen
dc.contributor.authorStojanović, Milicaen
dc.date.accessioned2020-04-26T19:14:52Z-
dc.date.available2020-04-26T19:14:52Z-
dc.date.issued2013-08-01en
dc.identifier.issn0233-1934en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/481-
dc.description.abstractIn this paper, we consider the problem of determining the minimal cardinality of double resolving sets for prism graphs. It is proved that the minimal cardinality is equal to four if is even and equal to three if is odd.en
dc.publisherTaylor & Francis-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofOptimizationen
dc.subjectgeneralized Petersen graphs | metric dimension | minimal doubly resolving set | prism graphsen
dc.titleMinimal doubly resolving sets of prism graphsen
dc.typeArticleen
dc.identifier.doi10.1080/02331934.2013.772999en
dc.identifier.scopus2-s2.0-84880926368en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage1037en
dc.relation.lastpage1043en
dc.relation.issue8en
dc.relation.volume62en
dc.description.rankM22-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

27
checked on Apr 17, 2025

Page view(s)

22
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.