Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/3182
DC FieldValueLanguage
dc.contributor.authorSavić, Aleksandaren_US
dc.date.accessioned2026-02-24T14:03:31Z-
dc.date.available2026-02-24T14:03:31Z-
dc.date.issued2025-01-01-
dc.identifier.issn00255165-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/3182-
dc.description.abstractThe problem of finding an open-locating dominating set is a variant of the domination problem where both domination and the ability to identify a certain vertex are required. The cardinality of such a dominating set is called the open-locating dominating number. The open-locating domination problem has been proven to be NP-hard in the general case. In this paper, the exact value of the old domination number is provided for the class of Flower snark graphs.en_US
dc.language.isoenen_US
dc.publisherBeograd : Društvo matematičara Srbijeen_US
dc.relation.ispartofMatematicki Vesniken_US
dc.subjectFlower snarksen_US
dc.subjectgraphsen_US
dc.subjectOpen-locating dominating seten_US
dc.titleOpen-Locating Dominating Number for Flower Snarksen_US
dc.typeArticleen_US
dc.identifier.doi10.57016/MV-ZQFW8315-
dc.identifier.scopus2-s2.0-105011307896-
dc.identifier.isi001530087100009-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/105011307896-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0025-5165en_US
dc.description.rankM22en_US
dc.relation.firstpage277en_US
dc.relation.lastpage282en_US
dc.relation.volume77en_US
dc.relation.issue3en_US
item.grantfulltextnone-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0009-0003-8568-4260-
Appears in Collections:Research outputs
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


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