{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:16:50Z","timestamp":1769167010259,"version":"3.49.0"},"reference-count":36,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T00:00:00Z","timestamp":1544054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A convex polytope or simply polytope is the convex hull of a finite set of points in Euclidean space     R d    . Graphs of convex polytopes emerge from geometric structures of convex polytopes by preserving the adjacency-incidence relation between vertices. In this paper, we study the problem of binary locating-dominating number for the graphs of convex polytopes which are symmetric rotationally. We provide an integer linear programming (ILP) formulation for the binary locating-dominating problem of graphs. We have determined the exact values of the binary locating-dominating number for two infinite families of convex polytopes. The exact values of the binary locating-dominating number are obtained for two rotationally-symmetric convex polytopes families. Moreover, certain upper bounds are determined for other three infinite families of convex polytopes. By using the ILP formulation, we show tightness in the obtained upper bounds.<\/jats:p>","DOI":"10.3390\/sym10120727","type":"journal-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T03:46:14Z","timestamp":1544154374000},"page":"727","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes"],"prefix":"10.3390","volume":"10","author":[{"given":"Hassan","family":"Raza","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Anhui University, Hefei 230601, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6842-7604","authenticated-orcid":false,"given":"Sakander","family":"Hayat","sequence":"additional","affiliation":[{"name":"Faculty of Engineering Sciences, GIK Institute of Engineering Sciences and Technology, Topi, Swabi 23460, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Feng","family":"Pan","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Anhui University, Hefei 230601, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., and Slater, P. (1998). Fundamentals of Domination in Graphs, CRC Press.","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","article-title":"Locating and total dominating sets in trees","volume":"154","author":"Haynes","year":"2006","journal-title":"Discret. Appl. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.disc.2005.09.027","article-title":"Extremal cardinalities for identifying and locating-dominating codes in graphs","volume":"307","author":"Charon","year":"2007","journal-title":"Discret. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ipl.2015.04.005","article-title":"On the ensemble of optimal dominating and locating-dominating codes in a graph","volume":"115","author":"Honkala","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.ejc.2004.09.002","article-title":"On locating-dominating sets in infinite grids","volume":"27","author":"Honkala","year":"2006","journal-title":"Eur. J. Comb."},{"key":"ref_6","first-page":"109","article-title":"Open neighborhood locating-dominating sets","volume":"46","author":"Seo","year":"2010","journal-title":"Australas. J. Comb."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.dam.2010.12.010","article-title":"Open neighborhood locating-dominating in trees","volume":"159","author":"Seo","year":"2011","journal-title":"Discret. Appl. Math."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","article-title":"Fault-tolerant locating-dominating sets","volume":"249","author":"Slater","year":"2002","journal-title":"Discret. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.endm.2014.08.030","article-title":"LD-graphs and global location-domination in bipartite graphs","volume":"46","author":"Hernando","year":"2014","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/net.3230170105","article-title":"Domination and location in acyclic graphs","volume":"17","author":"Slater","year":"1987","journal-title":"Networks"},{"key":"ref_11","first-page":"1073","article-title":"Locating dominating sets and locating-dominating sets","volume":"Volume 2","author":"Alavi","year":"1995","journal-title":"Graph Theory, Combinatorics, and Algorithms, Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Kalamazoo, MI, USA, June 1\u20135, 1992"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1109\/TIT.2002.800490","article-title":"Identifying and locating-dominating codes: NP-completeness results for directed graphs","volume":"48","author":"Charon","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","article-title":"Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard","volume":"290","author":"Charon","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"ref_14","unstructured":"Lobstein, A. (2018, November 16). Watching Systems, Identifying, Locating-Dominating and Discriminating Codes in Graphs. Available online: http:\/\/perso.telecom-paristech.fr\/~lobstein\/debutBIBidetlocdom.pdf."},{"key":"ref_15","first-page":"24","article-title":"Labelings of two classes of convex polytopes","volume":"34","year":"1988","journal-title":"Util. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-5060(08)70599-5","article-title":"On magic labellings of convex polytopes","volume":"51","year":"1992","journal-title":"Ann. Discret. Math."},{"key":"ref_17","first-page":"43","article-title":"Families of plane graphs with constant metric dimension","volume":"88","author":"Imran","year":"2012","journal-title":"Util. Math."},{"key":"ref_18","first-page":"45","article-title":"On the metric dimension of rotationally-symmetric convex polytopes","volume":"3","author":"Imran","year":"2015","journal-title":"J. Algebra Comb. Discret. Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2629","DOI":"10.1016\/j.camwa.2010.08.090","article-title":"On families of convex polytopes with constant metric dimension","volume":"60","author":"Imran","year":"2010","journal-title":"Comput. Math. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s13370-015-0336-5","article-title":"On the metric dimension of two families of convex polytopes","volume":"27","author":"Malik","year":"2016","journal-title":"Afr. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"9790","DOI":"10.1016\/j.amc.2012.03.047","article-title":"Minimal doubly resolving sets and the strong metric dimension of some convex polytopes","volume":"218","author":"Kratica","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_22","unstructured":"Salman, M., Javaid, I., and Chaudhry, M.A. (arXiv, 2014). Minimum fault-tolerant, local and strong metric dimension of graphs, arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.26493\/1855-3974.973.479","article-title":"The binary locating-dominating number of some convex polytopes","volume":"13","year":"2017","journal-title":"ARS Math. Cont."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.cplett.2017.09.055","article-title":"Computing distance-based topological descriptors of complex chemical networks: New theoretical techniques","volume":"688","author":"Hayat","year":"2017","journal-title":"Chem. Phys. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.amc.2014.04.091","article-title":"Computation of topological indices of certain networks","volume":"240","author":"Hayat","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"ref_26","first-page":"144","article-title":"Computing topological indices of honeycomb derived networks","volume":"18","author":"Hayat","year":"2015","journal-title":"Rom. J. Inf. Sci. Tech."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.apm.2018.03.016","article-title":"Valency-based topological descriptors of chemical networks and their applications","volume":"60","author":"Hayat","year":"2018","journal-title":"Appl. Math. Model."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00094-D","article-title":"Generalized domination and efficient domination in graphs","volume":"159","author":"Bange","year":"1996","journal-title":"Discret. Math."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Sweigart, D.B., Presnell, J., and Kincaid, R. (2014, January 25). An integer program for open locating dominating sets and its results on the hexagon-triangle infinite grid and other graphs. Proceedings of the 2014 Systems and Information Engineering Design Symposium (SIEDS), Charlottesville, VA, USA.","DOI":"10.1109\/SIEDS.2014.6829887"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"343","DOI":"10.2298\/YJOR140219014H","article-title":"New variable neighbourhood search based 0-1 MIP heuristics","volume":"25","author":"Hanafi","year":"2015","journal-title":"Yugoslav J. Oper. Res."},{"key":"ref_31","first-page":"221","article-title":"Face anti-magic labelings of convex polytopes","volume":"55","year":"1999","journal-title":"Util. Math."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s10474-016-0606-1","article-title":"Computing the metric dimension of convex polytopes generated by wheel related graphs","volume":"149","author":"Imran","year":"2016","journal-title":"Acta Math. Hung."},{"key":"ref_33","first-page":"89","article-title":"Vertex-magic total labeling of generalized Petersen graphs and convex polytopes","volume":"59","author":"Miller","year":"2006","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0252-9602(12)60204-5","article-title":"On classes of regular graphs with constant metric dimension","volume":"33B","author":"Imran","year":"2013","journal-title":"Acta Math. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.amc.2018.07.010","article-title":"On the fault-tolerant metric dimension of convex polytopes","volume":"339","author":"Raza","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_36","unstructured":"Erickson, J., and Scott, K. (arXiv, 2001). Arbitrarily large neighborly families of congruent symmetric convex polytopes, arXiv."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/12\/727\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:31:49Z","timestamp":1760196709000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/12\/727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,6]]},"references-count":36,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["sym10120727"],"URL":"https:\/\/doi.org\/10.3390\/sym10120727","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,6]]}}}