{"title":"The doubly metric dimensions of cactus graphs and block graphs","authors":"Kairui Nie, Kexiang Xu","doi":"10.1007/s10878-024-01168-0","DOIUrl":null,"url":null,"abstract":"<p>Given a connected graph <i>G</i>, two vertices <span>\\(u,v\\in V(G)\\)</span> doubly resolve <span>\\(x,y\\in V(G)\\)</span> if <span>\\(d_{G}(x,u)-d_{G}(y,u)\\ne d_{G}(x,v)-d_{G}(y,v)\\)</span>. The doubly metric dimension <span>\\(\\psi (G)\\)</span> of <i>G</i> is the cardinality of a minimum set of vertices that doubly resolves each pair of vertices from <i>V</i>(<i>G</i>). It is well known that deciding the doubly metric dimension of <i>G</i> is NP-hard. In this work we determine the exact values of doubly metric dimensions of unicyclic graphs which completes the known result. Furthermore, we give formulae for doubly metric dimensions of cactus graphs and block graphs.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"22 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01168-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Given a connected graph G, two vertices \(u,v\in V(G)\) doubly resolve \(x,y\in V(G)\) if \(d_{G}(x,u)-d_{G}(y,u)\ne d_{G}(x,v)-d_{G}(y,v)\). The doubly metric dimension \(\psi (G)\) of G is the cardinality of a minimum set of vertices that doubly resolves each pair of vertices from V(G). It is well known that deciding the doubly metric dimension of G is NP-hard. In this work we determine the exact values of doubly metric dimensions of unicyclic graphs which completes the known result. Furthermore, we give formulae for doubly metric dimensions of cactus graphs and block graphs.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.