{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:54:52Z","timestamp":1777704892003,"version":"3.51.4"},"reference-count":30,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,1,4]]},"abstract":"<jats:p>Fault-tolerant resolving partition is natural extension of resolving partitions which have many applications in different areas of computer sciences for example sensor networking, intelligent systems, optimization and robot navigation. For a nontrivial connected graph G\u00a0(V\u00a0(G)\u00a0, E\u00a0(G)), the partition representation of vertex v with respect to an ordered partition \u03a0\u00a0=\u00a0{Si\u00a0:\u00a01\u00a0\u2264\u00a0i\u00a0\u2264\u00a0k} of V\u00a0(G) is the k-vector r ( v | \u03a0 ) = ( d ( v , S i ) ) i = 1 k , where, d\u00a0(v, Si)\u00a0=\u00a0min\u00a0{d\u00a0(v, x)\u00a0|x\u00a0\u2208\u00a0Si}, for i\u00a0\u2208\u00a0{1, 2, \u2026, k}. A partition \u03a0 is said to be fault-tolerant partition resolving set of G if r\u00a0(u|\u03a0) and r\u00a0(v|\u03a0) differ by at least two places for all u\u00a0\u2260\u00a0v\u00a0\u2208\u00a0V\u00a0(G). A fault-tolerant partition resolving set of minimum cardinality is called the fault-tolerant partition basis of G and its cardinality the fault-tolerant partition dimension of G denoted by P ( G ) . In this article, we will compute fault-tolerant partition dimension of families of tadpole and necklace graphs.<\/jats:p>","DOI":"10.3233\/jifs-201390","type":"journal-article","created":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T15:21:12Z","timestamp":1603812072000},"page":"1129-1135","source":"Crossref","is-referenced-by-count":13,"title":["On fault-tolerant partition dimension of graphs"],"prefix":"10.1177","volume":"40","author":[{"given":"Kamran","family":"Azhar","sequence":"first","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":"Agha","family":"Kashif","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":[{"issue":"1","key":"10.3233\/JIFS-201390_ref1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.5614\/ejgta.2019.7.1.7","article-title":"Metric dimension of fullerene graphs","volume":"7","author":"Akhter","year":"2019","journal-title":"Electron J Graph Theory Appl"},{"key":"10.3233\/JIFS-201390_ref2","doi-asserted-by":"crossref","unstructured":"Akram M. , m\u2013Polar fuzzy graphs, Springer International Publishing (2019).","DOI":"10.1007\/978-3-030-03751-2"},{"key":"10.3233\/JIFS-201390_ref3","doi-asserted-by":"crossref","unstructured":"Akram M. and Zafar F. , Hybrid soft computing models applied to graph theory, Springer International Publishing (2020).","DOI":"10.1007\/978-3-030-16020-3"},{"key":"10.3233\/JIFS-201390_ref4","doi-asserted-by":"crossref","unstructured":"Akram M. and Luqman A. , Fuzzy hypergraphs and related extensions, Springer International Publishing (2020).","DOI":"10.1007\/978-981-15-2403-5"},{"key":"10.3233\/JIFS-201390_ref5","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"},{"key":"10.3233\/JIFS-201390_ref6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: A survey","volume":"24","author":"Bermound","year":"1995","journal-title":"J Parallel Distrib Comput"},{"key":"10.3233\/JIFS-201390_ref7","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-201390_ref8","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-201390_ref9","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-201390_ref10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2018.09.022","article-title":"On the k\u2013partition dimension of graphs","volume":"806","author":"Estrada-Moreno","year":"2020","journal-title":"Theor Compu Sci"},{"key":"10.3233\/JIFS-201390_ref11","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"},{"key":"10.3233\/JIFS-201390_ref13","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-201390_ref14","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-201390_ref15","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"},{"key":"10.3233\/JIFS-201390_ref17","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":"3","key":"10.3233\/JIFS-201390_ref18","first-page":"159","article-title":"Graphs of orderwith fault-tolerant partition dimension n \u20131","volume":"76","author":"Javaid","year":"2014","journal-title":"U. P. B Sci. Bull., Series A"},{"key":"10.3233\/JIFS-201390_ref19","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":"1","key":"10.3233\/JIFS-201390_ref21","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-201390_ref22","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":"1","key":"10.3233\/JIFS-201390_ref23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0734-189X(84)90051-3","article-title":"Metric bases in digital geometry","volume":"25","author":"Melter","year":"1984","journal-title":"Computer Vision, Graphics and Image Processing"},{"issue":"1","key":"10.3233\/JIFS-201390_ref24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4236\/ojdm.2012.21005","article-title":"On cycle related graphs with constant metric dimension","volume":"2","author":"Murtaza","year":"2012","journal-title":"Open J Discrete Math"},{"key":"10.3233\/JIFS-201390_ref25","doi-asserted-by":"publisher","DOI":"10.3390\/math7010078"},{"key":"10.3233\/JIFS-201390_ref26","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-201390_ref27","first-page":"187","article-title":"Fault-tolerant metric and partition dimension of graphs","volume":"83","author":"Salman","year":"2010","journal-title":"Utilitas Mathematica"},{"key":"10.3233\/JIFS-201390_ref28","first-page":"263","article-title":"Faulttolerance in resolvability","volume":"80","author":"Salman","year":"2009","journal-title":"Utilitas Mathematica"},{"issue":"1","key":"10.3233\/JIFS-201390_ref29","first-page":"1","article-title":"The partition dimension of cycle books graph,1\u20138","volume":"974","author":"Santoso","year":"2018","journal-title":"Phys Conf Series"},{"issue":"4","key":"10.3233\/JIFS-201390_ref30","doi-asserted-by":"crossref","first-page":"781","DOI":"10.22190\/FUMI1904781S","article-title":"Fault-tolerant metric dimension of circulant graphs","volume":"34","author":"Seyedi","year":"2019","journal-title":"Facta Universitatis (NIS) Ser Math Inform"},{"key":"10.3233\/JIFS-201390_ref31","first-page":"549","article-title":"Leaves of Trees, In","volume":"14","author":"Slater","year":"1975","journal-title":"Proc. 6th Southeastern Conf. Combinatorics, Graph Theory, and Computing, Congressus Numerantium"},{"issue":"2","key":"10.3233\/JIFS-201390_ref32","doi-asserted-by":"crossref","first-page":"116","DOI":"10.19184\/ijc.2019.3.2.5","article-title":"The locating-chromatic number and partition dimension of fibonacene graphs","volume":"3","author":"Suryaningsih","year":"2019","journal-title":"Indonesian Journal of Combinatorics"},{"issue":"1","key":"10.3233\/JIFS-201390_ref33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.12785\/amis\/090109","article-title":"R-Sets and metric dimension of necklace graphs","volume":"9","author":"Tomescu","year":"2015","journal-title":"Appl Math Inf Sci"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-201390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:17Z","timestamp":1777455737000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-201390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-201390","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]}}}