{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:31:45Z","timestamp":1787085105217,"version":"build-2736575974"},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.dam.2026.06.024","type":"journal-article","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T14:07:35Z","timestamp":1783087655000},"page":"199-206","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Metric and edge metric dimensions of generalized Andr\u00e1sfai graphs"],"prefix":"10.1016","volume":"393","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1922-910X","authenticated-orcid":false,"given":"S.","family":"Prabhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K. Bharani","family":"Dharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Radha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akbar","family":"Davoodi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b1","first-page":"2683","article-title":"Edge metric dimension of honeycomb and hexagonal networks for IoT","volume":"71","author":"Abbas","year":"2022","journal-title":"Comput. Mater. Contin."},{"key":"10.1016\/j.dam.2026.06.024_b2","article-title":"Computation of edge resolvability of benzenoid tripod structure","volume":"1","author":"Ahmad","year":"2021","journal-title":"J. Math. Univ. Tokushima"},{"key":"10.1016\/j.dam.2026.06.024_b3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.12688\/f1000research.128866.1","article-title":"Local multiset dimension of amalgamation graphs","volume":"12","author":"Alfarisi","year":"2023","journal-title":"F1000Research"},{"key":"10.1016\/j.dam.2026.06.024_b4","article-title":"Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension","volume":"452","author":"Arulperumjothi","year":"2023","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.06.024_b5","first-page":"277","article-title":"Metric basis in circulant networks","volume":"136","author":"Azhar","year":"2018","journal-title":"Ars Combin."},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0095-8956(79)90079-0","article-title":"Spectra of Cayley graphs","volume":"27","author":"Babai","year":"1979","journal-title":"Comb. Theory, Ser. B"},{"issue":"02","key":"10.1016\/j.dam.2026.06.024_b7","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830917500276","article-title":"A characterization of some graphs with metric dimension two","volume":"9","author":"Behtoei","year":"2017","journal-title":"Discrete Math. Algorithms Appl."},{"key":"10.1016\/j.dam.2026.06.024_b8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.7151\/dmgaa.1401","article-title":"Generalized Andr\u00e1sfai graphs","volume":"42","author":"Biswas","year":"2022","journal-title":"Discuss. Math. - Gen. Algebra Appl."},{"key":"10.1016\/j.dam.2026.06.024_b9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.laa.2023.07.016","article-title":"Chromatic numbers of Cayley graphs of Abelian groups: A matrix method","volume":"676","author":"Cervantes","year":"2023","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.06.024_b10","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.1016\/j.dam.2026.06.024_b11","first-page":"47","article-title":"The theory and applications of resolvability in graphs, a survey","volume":"160","author":"Chartrand","year":"2003","journal-title":"Congr. Numer."},{"issue":"4","key":"10.1016\/j.dam.2026.06.024_b12","doi-asserted-by":"crossref","DOI":"10.7494\/OpMath.2017.37.4.509","article-title":"The metric dimension of circulant graphs and their Cartesian products","volume":"37","author":"Chau","year":"2017","journal-title":"Opuscula Math."},{"issue":"4","key":"10.1016\/j.dam.2026.06.024_b13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0743-7315(86)90010-9","article-title":"A design methodology for synthesizing parallel algorithms and architectures","volume":"3","author":"Chen","year":"1986","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"10.1016\/j.dam.2026.06.024_b14","doi-asserted-by":"crossref","first-page":"554","DOI":"10.20965\/jaciii.2023.p0554","article-title":"Local metric dimension of certain classes of circulant networks","volume":"27","author":"Cynthia","year":"2023","journal-title":"J. Adv. Comput. Intell. Intell. Informatics"},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b15","doi-asserted-by":"crossref","first-page":"328","DOI":"10.4153\/S0008439523000759","article-title":"On the metric dimension of circulant graphs","volume":"67","author":"Gao","year":"2024","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.dam.2026.06.024_b16","first-page":"118","volume":"207","author":"Godsil","year":"2001","journal-title":"Springer Sci. Bus. Media"},{"issue":"3","key":"10.1016\/j.dam.2026.06.024_b17","first-page":"417","article-title":"The metric dimension of the circulant graph C(n\u00b1{1,2,3,4})","volume":"69","author":"Grigorious","year":"2017","journal-title":"Aust. J. Comb."},{"key":"10.1016\/j.dam.2026.06.024_b18","first-page":"47","article-title":"On the metric dimension of circulant and Harary graphs","volume":"248","author":"Grigorious","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.06.024_b19","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.06.024_b20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","article-title":"On the metric dimension of some families of graphs","volume":"22","author":"Hernando","year":"2005","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2026.06.024_b21","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1007\/s10255-016-0627-0","article-title":"On the metric dimension of barycentric subdivision of Cayley graphs","volume":"32","author":"Imran","year":"2016","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"3","key":"10.1016\/j.dam.2026.06.024_b22","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.aml.2011.09.008","article-title":"On the metric dimension of circulant graphs","volume":"25","author":"Imran","year":"2012","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"10.1016\/j.dam.2026.06.024_b23","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830918500088","article-title":"On the metric dimension and diameter of circulant graphs with three jumps","volume":"10","author":"Imran","year":"2018","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b24","first-page":"31","article-title":"On resolvability in double-step circulant graphs","volume":"76","author":"Imran","year":"2014","journal-title":"UPB Sci. Bull. Ser. A"},{"issue":"12","key":"10.1016\/j.dam.2026.06.024_b25","first-page":"1800","article-title":"Metric dimension and determining number of Cayley graphs","volume":"18","author":"Javaid","year":"2012","journal-title":"World Appl. Sci. J."},{"issue":"1","key":"10.1016\/j.dam.2026.06.024_b26","first-page":"21","article-title":"Families of regular graphs with constant metric dimension","volume":"75","author":"Javaid","year":"2008","journal-title":"Util. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b27","doi-asserted-by":"crossref","DOI":"10.26493\/1855-3974.2568.55c","article-title":"On metric dimensions of hypercubes","volume":"23","author":"Kelenc","year":"2021","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.dam.2026.06.024_b28","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.dam.2018.05.052","article-title":"Uniquely identifying the edges of a graph: the edge metric dimension","volume":"251","author":"Kelenc","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.06.024_b29","doi-asserted-by":"crossref","first-page":"58595","DOI":"10.1109\/ACCESS.2019.2914933","article-title":"On the metric index of circulant networks\u2013an algorithmic approach","volume":"7","author":"Khalid","year":"2019","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.dam.2026.06.024_b30","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"Khuller","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.06.024_b31","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1007\/s11590-020-01669-x","article-title":"Edge metric dimensions via hierarchical product and integer linear programming","volume":"15","author":"Klav\u030czar","year":"2021","journal-title":"Optim. Lett."},{"key":"10.1016\/j.dam.2026.06.024_b32","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.dam.2021.02.020","article-title":"A note on the metric and edge metric dimensions of 2- connected graphs","volume":"319","author":"Knor","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.06.024_b33","article-title":"Graphs with the edge metric dimension smaller than the metric dimension","volume":"401","author":"Knor","year":"2021","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.06.024_b34","doi-asserted-by":"crossref","first-page":"126734","DOI":"10.1109\/ACCESS.2019.2938579","article-title":"Computing metric dimension of certain families of Toeplitz graphs","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.dam.2026.06.024_b35","doi-asserted-by":"crossref","first-page":"74550","DOI":"10.1109\/ACCESS.2021.3072554","article-title":"Computing metric dimension of power of total graph","volume":"9","author":"Nawaz","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.dam.2026.06.024_b36","doi-asserted-by":"crossref","first-page":"165060","DOI":"10.1109\/ACCESS.2019.2952192","article-title":"On the families of graphs with unbounded metric dimension","volume":"7","author":"Pan","year":"2019","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.dam.2026.06.024_b37","doi-asserted-by":"crossref","first-page":"415","DOI":"10.7494\/OpMath.2019.39.3.415","article-title":"Metric dimension of Andr\u00e1sfai graphs","volume":"39","author":"Pejman","year":"2019","journal-title":"Opuscula Math."},{"key":"10.1016\/j.dam.2026.06.024_b38","doi-asserted-by":"crossref","first-page":"2465","DOI":"10.1007\/s40840-019-00816-7","article-title":"Edge metric dimension of some graph operations","volume":"43","author":"Peterin","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"10.1016\/j.dam.2026.06.024_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2026.105243","article-title":"Fault-tolerant resolving power domination of fractal cubic network","volume":"211","author":"Prabhu","year":"2026","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"10.1016\/j.dam.2026.06.024_b40","first-page":"6421","article-title":"On independent resolving number of TiO2[m,n] nanotubes","volume":"35","author":"Prabhu","year":"2018","journal-title":"J. Intell. Fuzzy Systems"},{"key":"10.1016\/j.dam.2026.06.024_b41","article-title":"Metric dimensions of generalized Sierpi\u0144ski graphs over squares","volume":"505","author":"Prabhu","year":"2025","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.dam.2026.06.024_b42","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/09728600.2023.2280799","article-title":"Metric dimension of irregular convex triangular networks","volume":"21","author":"Prabhu","year":"2023","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"10.1016\/j.dam.2026.06.024_b43","article-title":"Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks","volume":"420","author":"Prabhu","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.06.024_b44","doi-asserted-by":"crossref","first-page":"15783","DOI":"10.1007\/s11227-024-06053-5","article-title":"Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures","volume":"80","author":"Prabhu","year":"2024","journal-title":"J. Supercomput."},{"key":"10.1016\/j.dam.2026.06.024_b45","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."},{"key":"10.1016\/j.dam.2026.06.024_b46","first-page":"549","volume":"14","author":"Slater","year":"1975","journal-title":"Ars Combin."},{"issue":"7","key":"10.1016\/j.dam.2026.06.024_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.jksus.2023.102834","article-title":"The metric dimension of the circulant graph with 2k generators can be less than k","volume":"35","author":"T.\u00a0Vetr\u00edk","year":"2023","journal-title":"J. King Saud University-Science"},{"issue":"1","key":"10.1016\/j.dam.2026.06.024_b48","first-page":"49","article-title":"On the metric dimension of circulant graphs with 2 generators","volume":"43","author":"Toit","year":"2019","journal-title":"Kragujevac J. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b49","doi-asserted-by":"crossref","first-page":"104","DOI":"10.55016\/ojs\/cdm.v12i2.62479","article-title":"On the metric dimension of circulant graphs with 4 generators","volume":"12","author":"Vetr\u00edk","year":"2017","journal-title":"Contrib. Discret. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.06.024_b50","doi-asserted-by":"crossref","first-page":"67","DOI":"10.7151\/dmgt.2110","article-title":"On the metric dimension of directed and undirected circulant graphs","volume":"40","author":"Vetr\u00edk","year":"2019","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.06.024_b51","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s10878-019-00472-4","article-title":"On the edge metric dimension of convex polytopes and its related graphs","volume":"39","author":"Zhang","year":"2020","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.06.024_b52","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.dam.2018.08.031","article-title":"On graphs with the maximum edge metric dimension","volume":"257","author":"Zhu","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.06.024_b53","doi-asserted-by":"crossref","first-page":"589","DOI":"10.7151\/dmgt.2210","article-title":"Asymptotic behavior of the edge metric dimension of the random graph","volume":"41","author":"Zublirina","year":"2021","journal-title":"Discuss. Math. Graph Theory"},{"issue":"7","key":"10.1016\/j.dam.2026.06.024_b54","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1016\/j.disc.2018.04.010","article-title":"On the edge dimension of a graph","volume":"341","author":"Zubrilina","year":"2018","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T20:11:04Z","timestamp":1787083864000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":54,"alternative-id":["S0166218X26003537"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.024","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Metric and edge metric dimensions of generalized Andr\u00e1sfai graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.06.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}