{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:25:40Z","timestamp":1772137540683,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3160715","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T20:25:00Z","timestamp":1647894300000},"page":"32394-32405","source":"Crossref","is-referenced-by-count":6,"title":["Computing Antimagic Labeling of Lattically Designed Symmetric Networks"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-8260","authenticated-orcid":false,"given":"Hafiz Usman","family":"Afzal","sequence":"first","affiliation":[{"name":"Department of Mathematics, School of Science, University of Management and Technology, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1249-6424","authenticated-orcid":false,"given":"Ahmed","family":"Alamer","sequence":"additional","affiliation":[{"name":"Department of Mathematics, College of Science, University of Tabuk, Tabuk, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7241-8172","authenticated-orcid":false,"given":"Muhammad","family":"Javaid","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Science, University of Management and Technology, Lahore, Pakistan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpr.2020.09.371"},{"key":"ref2","volume-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"ref3","first-page":"163","article-title":"Problem 27 in the theory of graphs and its applications","volume-title":"Proc. Symp. Smolenice","author":"Sedlacek"},{"key":"ref4","volume-title":"Pearls in Graph Theory","author":"Hartsfield","year":"1990"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-104-7"},{"key":"ref6","first-page":"83","article-title":"Another tree conjecture","volume":"18","author":"Ringel","year":"1996","journal-title":"Bull. Inst. Combin. Appl."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1970-084-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.55937\/sut\/991985322"},{"key":"ref9","first-page":"179","article-title":"Two new $(a, d)$\n-EAT graph labelings","volume-title":"Proc. 11th Austrailian Workshop Combinat. Algorithm","author":"Simanjuntak"},{"key":"ref10","article-title":"All trees with at most 17 vertices are super edgemagic","volume-title":"Proc. 16th MCCCC Conf.","author":"Lee"},{"key":"ref11","first-page":"275","article-title":"On super edge- magic total labeling of a subdivision of a star $S_{n}$","volume":"81","author":"Salman","year":"2010","journal-title":"Utiltas Mathematica."},{"key":"ref12","first-page":"503","article-title":"On super $(a, d)$\n-edge-antimagic total labeling of a class of trees","volume":"105","author":"Javaid","year":"2012","journal-title":"Ars Combinatoria"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1764"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/02522667.2017.1406625"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2017.02.001"},{"key":"ref16","first-page":"183","article-title":"Super edge-magic total labeling on W-trees","volume":"86","author":"Javaid","year":"2011","journal-title":"Utilitas Math."},{"key":"ref17","first-page":"293","article-title":"On $(a, d)$\n edge- antimagic total labeling of extended W-trees","volume":"87","author":"Javaid","year":"2012","journal-title":"Utilitas Math."},{"issue":"2","key":"ref18","first-page":"115","article-title":"On super $(a, d)$\n-edge-antimagic total labeling of generalized extended W-trees","volume":"11","author":"Javaid","year":"2014","journal-title":"AKCE Int. J. Graphs Combinatorics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30540-8_19"},{"key":"ref20","first-page":"243","article-title":"On super edge-magic total labeling of banana trees","volume":"79","author":"Hussain","year":"2009","journal-title":"Utiltas Math."},{"key":"ref21","first-page":"227","article-title":"On super $(a, d)$\n edge- antimagic total labeling of subdivided caterpillar","volume":"98","author":"Javaid","year":"2015","journal-title":"Utilitas Math."},{"key":"ref22","first-page":"81","article-title":"On super edge- magic graph","volume":"64","author":"Figueroa-Centeno","year":"2002","journal-title":"Ars Combinatoria"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.37236\/27"},{"issue":"4","key":"ref24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.5121\/jgraphoc.2011.3404","article-title":"Radio number of wheel like graphs, International journal on applications of graph theory in wireless ad hoc networks and sensor networks","volume":"3","author":"Bhatti","year":"2011","journal-title":"Graph-Hoc"},{"key":"ref25","first-page":"447","article-title":"The radio antipodal and radio numbers of the hypercube","volume":"102","author":"Khennoufa","year":"2011","journal-title":"Ars Combinatoria"},{"key":"ref26","first-page":"225","article-title":"On edge-magic labelings of certain disjoint unions of graphs","volume":"32","author":"Figueroa-Centeno","year":"2005","journal-title":"Australas. J. Combinatorics"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1531"},{"key":"ref28","article-title":"New construction methods for vertex-magic total labeling of graphs","author":"Gray","year":"2006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00314-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.55937\/sut\/1343931268"},{"key":"ref31","first-page":"819","article-title":"Applications of graph labeling in major areas of computer science","volume":"3","author":"Prasanna","year":"2014","journal-title":"Int. J. Res. Comput. Commun. Technol."},{"key":"ref32","first-page":"893","article-title":"Applications of graph labeling in communication networks","volume":"7","author":"Prasanna","year":"2014","journal-title":"Oriental J. Comput. Sci. Technol."},{"key":"ref33","volume-title":"Wireless Communications","author":"Andreas","year":"2005"},{"key":"ref34","volume-title":"Radio Broadcasting, W2UC","author":"Wakefield","year":"1959"},{"issue":"8","key":"ref35","first-page":"14","article-title":"Applications of graph coloring and labeling in computer science","volume":"3","author":"Vinutha","year":"2017","journal-title":"Int. J. Future Revolution Comput. Sci. Commun. Eng."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1977.10517"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0070364"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-014-0213-x"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2012.10698377"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2015.1130935"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14445\/22315373\/IJMTT-V37P528"},{"key":"ref42","article-title":"On the super edge local antimagic total labeling of related ladder graph","volume-title":"Proc. J. Phys., Conf.","volume":"1465","author":"Agustin"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3934\/math.2020387"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09738601.pdf?arnumber=9738601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:24:31Z","timestamp":1705537471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9738601\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3160715","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}