{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:53:28Z","timestamp":1777704808512,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,6,21]]},"abstract":"<jats:p>The 2-metric resolvability is an extension of metric resolvability in graphs having several applications in intelligent systems for example network optimization, robot navigation and sensor networking. Rotationally symmetric graphs are important in intelligent networks due to uniform rate of data transformation to all nodes. In this article, 2-metric dimension of rotationally symmetric plane graphs Rn, Sn and Tn is computed and found to be independent of the number of vertices.<\/jats:p>","DOI":"10.3233\/jifs-210040","type":"journal-article","created":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T15:24:48Z","timestamp":1619537088000},"page":"11887-11895","source":"Crossref","is-referenced-by-count":4,"title":["On 2-metric resolvability in\u00a0rotationally-symmetric graphs"],"prefix":"10.1177","volume":"40","author":[{"given":"Humera","family":"Bashir","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Lahore, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zohaib","family":"Zahid","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Lahore, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agha","family":"Kashif","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Lahore, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sohail","family":"Zafar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Lahore, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Bao","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Physics, Anhui Jianzhu University, Hefei, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"4","key":"10.3233\/JIFS-210040_ref2","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1002\/jgt.22005","article-title":"Orienting triangulations","volume":"83","author":"Albar","year":"2015","journal-title":"Journal of Graph Theory"},{"key":"10.3233\/JIFS-210040_ref3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.7151\/dmgt.2087","article-title":"Error correcting codes from-resolving sets","volume":"39","author":"Bailey","year":"2017","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"10.3233\/JIFS-210040_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.01.011"},{"key":"10.3233\/JIFS-210040_ref6","unstructured":"Blumenthal L.M. , Theory and applications of distance geometry, Oxford University Press. (1953)."},{"key":"10.3233\/JIFS-210040_ref7","first-page":"47","article-title":"The theory and applications of resolvability in graphs","volume":"160","author":"Chartrand","year":"2003","journal-title":"A Survey Congressus Numerantium"},{"key":"10.3233\/JIFS-210040_ref8","first-page":"187","article-title":"Fault-tolerant metric and partition dimension of graphs","volume":"83","author":"Chaudhry","year":"2010","journal-title":"Util Math"},{"issue":"6","key":"10.3233\/JIFS-210040_ref9","first-page":"2829","article-title":"The\u2013metric dimension of a graph","volume":"9","author":"Estrado-Moreno","year":"2015","journal-title":"Applied Mathematics and Information Sciences"},{"issue":"7","key":"10.3233\/JIFS-210040_ref10","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.disc.2015.12.024","article-title":"The\u2013metric dimension of lexicographic product of graphs","volume":"339","author":"Estrado-Moreno","year":"2016","journal-title":"Discrete Mathematics"},{"issue":"1","key":"10.3233\/JIFS-210040_ref11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s40840-015-0282-2","article-title":"The\u2013metric dimension of corona product of graphs","volume":"39","author":"Estrado-Moreno","year":"2016","journal-title":"Bull Malays Math Sci Soc"},{"key":"10.3233\/JIFS-210040_ref13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.amc.2016.12.005","article-title":"Computing the\u2013metric dimension of graphs","volume":"300","author":"Estrado-Moreno","year":"2017","journal-title":"Applied Mathematics and Computation"},{"key":"10.3233\/JIFS-210040_ref15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.endm.2014.08.017","article-title":"\u2013metric resolvability in graphs","volume":"46","author":"Estrado-Moreno","year":"2014","journal-title":"Electron Notes Discrete Math"},{"key":"10.3233\/JIFS-210040_ref16","doi-asserted-by":"crossref","first-page":"2367","DOI":"10.1007\/s00373-016-1736-5","article-title":"Relationship between the 2\u2013metric dimension and the 2\u2013adjacency dimension in the lexicographic product of graphs","volume":"32","author":"Estrado-Moreno","year":"2016","journal-title":"Graphs and Combinatorics"},{"key":"10.3233\/JIFS-210040_ref17","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Combin"},{"key":"10.3233\/JIFS-210040_ref18","first-page":"81","article-title":"Fault-tolerant metric dimension of graphs","volume":"5","author":"Hernando","year":"2008","journal-title":"Convexity in Discrete Structures"},{"issue":"6","key":"10.3233\/JIFS-210040_ref19","doi-asserted-by":"crossref","first-page":"6609","DOI":"10.3934\/math.2020425","article-title":"On the 2-metric resolvability of graphs","volume":"5","author":"Huo","year":"2020","journal-title":"AIMS Mathematics"},{"key":"10.3233\/JIFS-210040_ref20","first-page":"663","article-title":"Families of Rotationally-Symmetric Plane Graphs with Constant Metric Dimension","volume":"36","author":"Imran","year":"2012","journal-title":"Southeast Asian Bulletin of Mathematics"},{"key":"10.3233\/JIFS-210040_ref21","first-page":"111","article-title":"On the meric dimension of rotationally-symmetric graph","volume":"124","author":"Imran","year":"2016","journal-title":"Ars Combin"},{"key":"10.3233\/JIFS-210040_ref22","first-page":"263","article-title":"Fault-Tolerance in resolvability","volume":"80","author":"Javaid","year":"2009","journal-title":"Utilitas Math"},{"key":"10.3233\/JIFS-210040_ref24","doi-asserted-by":"crossref","unstructured":"Maji D. and Ghorai G. , Computing F-index, coindex and Zagreb polynomials of the kth generalized transformation graphs, Heliyon 6(12) (2020).","DOI":"10.1016\/j.heliyon.2020.e05781"},{"key":"10.3233\/JIFS-210040_ref25","doi-asserted-by":"crossref","unstructured":"Maji D. and Ghorai G. , A novel graph invariant: The third leap Zagreb index under several graph operations, Discrete Mathematics, Algorithms and Applications 11(5) (2019).","DOI":"10.1142\/S179383091950054X"},{"issue":"1","key":"10.3233\/JIFS-210040_ref27","doi-asserted-by":"crossref","first-page":"78","DOI":"10.3390\/math7010078","article-title":"Fault-Tolerant resolvability and extremal structures of graphs","volume":"7","author":"Raza","year":"2019","journal-title":"Mathematics"},{"key":"10.3233\/JIFS-210040_ref28","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":"Applied Mathematics and Computation"},{"key":"10.3233\/JIFS-210040_ref29","doi-asserted-by":"crossref","first-page":"11560","DOI":"10.1109\/ACCESS.2019.2961191","article-title":"On mixed metric dimension of rotationally symmetric graphs","volume":"8","author":"Raza","year":"2020","journal-title":"IEEE Access"},{"key":"10.3233\/JIFS-210040_ref30","first-page":"179","article-title":"Fault-tolerant designs in triangular lattice network","volume":"219","author":"Shabbir","year":"2002","journal-title":"Discrete Math"},{"issue":"4","key":"10.3233\/JIFS-210040_ref31","first-page":"445","article-title":"Dominating and referece set in a graph","volume":"22","author":"Slater","year":"1988","journal-title":"Journal of Mathematical and Physical Sciences"},{"key":"10.3233\/JIFS-210040_ref32","first-page":"549","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congressus Numerantium"},{"key":"10.3233\/JIFS-210040_ref33","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","article-title":"Fault-tolerant locating dominant set","volume":"219","author":"Slater","year":"2002","journal-title":"Discrete Math"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:04Z","timestamp":1777455724000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":27,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210040","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]}}}