{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:50:01Z","timestamp":1777704601181,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,4,22]]},"abstract":"<jats:p>The partition dimension is a variant of metric dimension in graphs. It has arising applications in the fields of network designing, robot navigation, pattern recognition and image processing. Let G\u00a0(V\u00a0(G)\u00a0, E\u00a0(G)) be a connected graph and \u0393\u00a0=\u00a0{P1, P2, \u2026, Pm} be an ordered m-partition of V\u00a0(G). The partition representation of vertex v with respect to \u0393 is an m-vector r\u00a0(v|\u0393)\u00a0=\u00a0(d\u00a0(v, P1)\u00a0, d\u00a0(v, P2)\u00a0, \u2026, d\u00a0(v, Pm)), where d\u00a0(v, P)\u00a0=\u00a0min\u00a0{d\u00a0(v, x)\u00a0|x\u00a0\u2208\u00a0P} is the distance between v and P. If the m-vectors r\u00a0(v|\u0393) differ in at least 2 positions for all v\u00a0\u2208\u00a0V\u00a0(G), then the m-partition is called a 2-partition generator of G. A 2-partition generator of G with minimum cardinality is called a 2-partition basis of G and its cardinality is known as the 2-partition dimension of G. Circulant graphs outperform other network topologies due to their low message delay, high connectivity and survivability, therefore are widely used in telecommunication networks, computer networks, parallel processing systems and social networks. In this paper, we computed partition dimension of circulant graphs Cn\u00a0(1, 2) for n\u00a0\u2261\u00a02 (mod 4), n\u00a0\u2265\u00a018 and hence corrected the result given by Salman et al. [Acta Math. Sin. Engl. Ser. 2012, 28, 1851-1864]. We further computed the 2-partition dimension of Cn\u00a0(1, 2) for n\u00a0\u2265\u00a06.<\/jats:p>","DOI":"10.3233\/jifs-201982","type":"journal-article","created":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T18:19:15Z","timestamp":1612289955000},"page":"9493-9503","source":"Crossref","is-referenced-by-count":12,"title":["On 2-partition dimension of the circulant graphs"],"prefix":"10.1177","volume":"40","author":[{"given":"Asim","family":"Nadeem","sequence":"first","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":"Zohaib","family":"Zahid","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Management and Technology, Lahore, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-201982_ref1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.procs.2015.12.075","article-title":"The Partition Dimension of a Subdivision of a Complete Graph","volume":"74","author":"Amrullah","year":"2015","journal-title":"Procedia Comput Sci"},{"issue":"6","key":"10.3233\/JIFS-201982_ref2","first-page":"343","article-title":"L(0; 1)- and L(1; 1)-labelling problems on circular- arc graphs","volume":"11","author":"Amanathulla","year":"2016","journal-title":"Int J Soft Comput"},{"issue":"34","key":"10.3233\/JIFS-201982_ref3","first-page":"869","article-title":"L (3; 2; 1)- and L (4; 3; 2; 1)-labelling problems on circular-arc graphs","volume":"9","author":"Amanathulla","year":"2016","journal-title":"Int J Control Theory Appl"},{"issue":"3","key":"10.3233\/JIFS-201982_ref4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.akcej.2017.03.002","article-title":"L(3,2,1)- and L(4,3,2,1)- labeling problems on interval graphs","volume":"14","author":"Amanathulla","year":"2017","journal-title":"AKCE Int J Graphs Comb"},{"issue":"14","key":"10.3233\/JIFS-201982_ref5","first-page":"3939","article-title":"L (3; 2; 1)-labelling problems on permutation graphs","volume":"25","author":"Amanathulla","year":"2017","journal-title":"Transylvanian Review"},{"issue":"1","key":"10.3233\/JIFS-201982_ref6","first-page":"739","article-title":"(2; 1)-labelling of cycles and circular-arc graphs","volume":"35","author":"Amanathulla","year":"2018","journal-title":"JIFS"},{"key":"10.3233\/JIFS-201982_ref7","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.3233\/JIFS-201390","article-title":"On faulttolerent partition dimension of graphs","volume":"40","author":"Azhar","year":"2021","journal-title":"J Intell Fuzzy Syst"},{"issue":"4","key":"10.3233\/JIFS-201982_ref8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J Graph Theor"},{"issue":"12","key":"10.3233\/JIFS-201982_ref9","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","article-title":"Reliable circulant networks with minimum transmission delay","volume":"32","author":"Boesch","year":"1985","journal-title":"Circuits Syst, IEEE Trans"},{"key":"10.3233\/JIFS-201982_ref10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discrete Appl Math"},{"key":"10.3233\/JIFS-201982_ref11","first-page":"187","article-title":"Fault-tolerant metric and partition dimension of graphs","volume":"83","author":"Chaudhry","year":"2010","journal-title":"Utilitas Mathematica"},{"key":"10.3233\/JIFS-201982_ref12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/PL00000127","article-title":"The partition dimension of a graph","volume":"59","author":"Chartrand","year":"2000","journal-title":"Aequ Math"},{"key":"10.3233\/JIFS-201982_ref13","doi-asserted-by":"crossref","unstructured":"Dewi M.P.K. and Kusmayadi T.A. , On the partition dimension of a lollipop graph and a generalized Jahangir graph, J Phys Conf Ser 855(1) (2017).","DOI":"10.1088\/1742-6596\/855\/1\/012012"},{"issue":"1","key":"10.3233\/JIFS-201982_ref14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.3190100103","article-title":"Connectivity of circulant digraphs","volume":"10","author":"Doorn","year":"1986","journal-title":"J Graph Theor"},{"key":"10.3233\/JIFS-201982_ref15","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2018.09.022","article-title":"On the-partition dimension of graphs","volume":"806","author":"Estrado-Moreno","year":"2020","journal-title":"Theor Compu Sci"},{"issue":"6","key":"10.3233\/JIFS-201982_ref16","first-page":"2829","article-title":"The-metric dimension of a graph","volume":"9","author":"Estrado-Moreno","year":"2015","journal-title":"Appl Math Inf Sci"},{"issue":"105","key":"10.3233\/JIFS-201982_ref17","first-page":"381","article-title":"On the partition dimension of unicyclic graphs, Bulletin Math\u00e9matique De La Soci\u00e9t\u00e9 Des Sciences Math\u00e9matiques De Roumanie","volume":"57","author":"Fernau","year":"2014","journal-title":"Nouvelle S\u00e9rie"},{"key":"10.3233\/JIFS-201982_ref18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.procs.2015.12.076","article-title":"The partition dimension of some families of trees","volume":"74","author":"Fredlina","year":"2015","journal-title":"Procedia Comput Sci"},{"issue":"3","key":"10.3233\/JIFS-201982_ref20","first-page":"417","article-title":"The metric dimension of the circulant graph(\u00b11,2, 3, 4)","volume":"69","author":"Grigorious","year":"2017","journal-title":"Australas. J. Combin"},{"key":"10.3233\/JIFS-201982_ref21","first-page":"180","article-title":"On the partition dimension of circulant graphs","volume":"60","author":"Grigorious","year":"2017","journal-title":"Comput J"},{"key":"10.3233\/JIFS-201982_ref22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.ipl.2014.02.005","article-title":"On the partition dimension of a class of circulant graphs","volume":"114","author":"Grigorious","year":"2014","journal-title":"Inf Process Lett"},{"key":"10.3233\/JIFS-201982_ref23","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Theory Comput. Syst. Ars Combinatoria"},{"issue":"1","key":"10.3233\/JIFS-201982_ref24","doi-asserted-by":"crossref","first-page":"18","DOI":"10.5614\/j.math.fund.sci.2017.49.1.2","article-title":"On the partition dimension of disconnected graphs","volume":"49","author":"Haryeni","year":"2017","journal-title":"J. Math Fund Sci"},{"key":"10.3233\/JIFS-201982_ref25","unstructured":"Hernando C. , Mora M. , Slater P.J. and Wood D.R. , Fault-tolerant metric dimension of graphs, In Proceedings International Conference on Convexity in Discrete Structures; Ramanujan Mathematical Society: Tiruchirappalli, India (2008), 81\u201385."},{"key":"10.3233\/JIFS-201982_ref26","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1515\/math-2018-0109","article-title":"Sharp bounds for partition dimension of generalized Mobius ladders","volume":"16","author":"Hussain","year":"2018","journal-title":"Open Math"},{"issue":"1","key":"10.3233\/JIFS-201982_ref27","first-page":"17","article-title":"On the metric dimension and diameter of circulant graphs with three jumps","volume":"10","author":"Imran","year":"2018","journal-title":"Discrete Math Algo and Apps"},{"key":"10.3233\/JIFS-201982_ref28","first-page":"1705","article-title":"The partition dimension of circulant graphs","volume":"18","author":"Javaid","year":"2012","journal-title":"World Appl Sci J"},{"key":"10.3233\/JIFS-201982_ref29","first-page":"263","article-title":"Fault tolerance in resolvability","volume":"80","author":"Javaid","year":"2009","journal-title":"Utilitas Mathematica"},{"key":"10.3233\/JIFS-201982_ref30","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in Graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discrete Appl. Math"},{"issue":"2","key":"10.3233\/JIFS-201982_ref31","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H","article-title":"Reliability analysis of circulant graphs[J]","volume":"31","author":"Li","year":"1998","journal-title":"Networks"},{"issue":"1","key":"10.3233\/JIFS-201982_ref33","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2989\/16073606.2017.1370031","article-title":"The partition dimension of circulant graphs","volume":"41","author":"Maritz","year":"2018","journal-title":"Quaest Math"},{"issue":"3","key":"10.3233\/JIFS-201982_ref34","doi-asserted-by":"crossref","first-page":"343","DOI":"10.3934\/Math.2018.3.343","article-title":"On the partition dimension of fullerene graphs","volume":"3","author":"Mehreen","year":"2018","journal-title":"AIMS Math"},{"issue":"4","key":"10.3233\/JIFS-201982_ref35","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1002\/net.20397","article-title":"Connectivity and diameter in distance graphs","volume":"57","author":"Penso","year":"2011","journal-title":"Networks"},{"issue":"1","key":"10.3233\/JIFS-201982_ref36","first-page":"106","article-title":"Detour g-interior nodes and detour g-boundary nodes in bipolar fuzzy graph with applications","volume":"49","author":"Poulik","year":"2020","journal-title":"Hacet J Math Stat"},{"issue":"7","key":"10.3233\/JIFS-201982_ref37","doi-asserted-by":"crossref","first-page":"5119","DOI":"10.1007\/s00500-019-04265-z","article-title":"Certain indices of graphs under bipolar fuzzy environment with applications","volume":"24","author":"Poulik","year":"2020","journal-title":"Soft Comput"},{"key":"10.3233\/JIFS-201982_ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2019.105315","article-title":"Note on \u201cBipolar fuzzy graphs with applications\"","volume":"192","author":"Poulik","year":"2020","journal-title":"Knowl-based Syst"},{"key":"10.3233\/JIFS-201982_ref39","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.ins.2020.09.050","article-title":"Determination of journeys order based on graph\u2019s Wiener absolute index with bipolar fuzzy information","volume":"545","author":"Poulik","year":"2021","journal-title":"Information Sciences"},{"key":"10.3233\/JIFS-201982_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05180-4"},{"key":"10.3233\/JIFS-201982_ref41","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":"10.3233\/JIFS-201982_ref42","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1007\/s10114-012-0417-4","article-title":"Resolvability in circulant graphs","volume":"28","author":"Salman","year":"2012","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"issue":"1","key":"10.3233\/JIFS-201982_ref43","first-page":"1","article-title":"The partition dimension of cycle books graph","volume":"974","author":"Santoso","year":"2018","journal-title":"J Phys Conf Series"},{"key":"10.3233\/JIFS-201982_ref44","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","article-title":"On metric generators of graphs","volume":"29","author":"Seb\u00f6","year":"2004","journal-title":"Math Oper Res"},{"key":"10.3233\/JIFS-201982_ref45","first-page":"1","article-title":"Computation of Metric Dimension and Partition Dimension of Nanotubes","volume":"2","author":"Siddiqui","year":"2015","journal-title":"J Comput Theor Nanos"},{"key":"10.3233\/JIFS-201982_ref46","first-page":"549","article-title":"Leaves of Trees","volume":"14","author":"Slater","year":"1975","journal-title":"Proc. 6th Southeastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium"},{"key":"10.3233\/JIFS-201982_ref47","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":"Yero","year":"2017","journal-title":"Appl Math Comput"},{"issue":"20","key":"10.3233\/JIFS-201982_ref48","doi-asserted-by":"crossref","first-page":"9955","DOI":"10.1007\/s00500-018-3552-8","article-title":"Novel decision-making method based on bipolar neutrosophic information","volume":"23","author":"Zhan","year":"2019","journal-title":"Soft Comput"},{"issue":"6","key":"10.3233\/JIFS-201982_ref49","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1007\/s13042-018-0827-4","article-title":"Novel decision-making algorithms based on intuitionistic fuzzy rough environment","volume":"10","author":"Zhan","year":"2019","journal-title":"Int J Mach Learn Cybern"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-201982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:34Z","timestamp":1777455694000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-201982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":47,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/jifs-201982","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]}}}