Determining the edge metric dimension of the generalized Petersen graph P(n, 3)
David G. L. Wang (),
Monica M. Y. Wang () and
Shiqiang Zhang ()
Additional contact information
David G. L. Wang: School of Mathematics and Statistics, Beijing Institute of Technology
Monica M. Y. Wang: School of Mathematics and Statistics, Beijing Institute of Technology
Shiqiang Zhang: Department of Computing, Imperial College London
Journal of Combinatorial Optimization, 2022, vol. 43, issue 2, No 9, 460-496
Abstract:
Abstract It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph P(n, k) is at least 3. We prove that the graph P(n, 3) has edge dimension 4 for $$n\ge 11$$ n ≥ 11 , by showing semi-combinatorially the nonexistence of an edge resolving set of order 3 and by constructing explicitly an edge resolving set of order 4.
Keywords: Generalized Petersen graph; Metric dimension; Resolving set; Floyd-Warshall algorithm; 05C30 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00780-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:43:y:2022:i:2:d:10.1007_s10878-021-00780-8
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-021-00780-8
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().