{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T07:15:05Z","timestamp":1779261305864,"version":"3.51.4"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1109\/access.2021.3058786","type":"journal-article","created":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T02:13:27Z","timestamp":1613182407000},"page":"54401-54406","source":"Crossref","is-referenced-by-count":4,"title":["Irregularity Strength of Circulant Graphs Using Algorithmic Approach"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4215-2825","authenticated-orcid":false,"given":"Muhammad Ahsan","family":"Asim","sequence":"first","affiliation":[{"name":"College of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3695-2145","authenticated-orcid":false,"given":"Roslan","family":"Hasni","sequence":"additional","affiliation":[{"name":"School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, Kuala Terengganu, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3434-9908","authenticated-orcid":false,"given":"Ali","family":"Ahmad","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4060-0655","authenticated-orcid":false,"given":"Basem","family":"Assiri","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8432-9836","authenticated-orcid":false,"given":"Andrea","family":"Semanicova-Fenovcikova","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Informatics, Technical University, Košice, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90321-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090774112"},{"key":"ref13","first-page":"11","article-title":"Graph compositions I: Basic enumeration","volume":"1","author":"knopfmacher","year":"2001","journal-title":"Integers Electron J Combin Numb Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1186\/s13677-016-0056-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/120886650"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2016.1177801"},{"key":"ref17","author":"rosen","year":"2012","journal-title":"Discrete Mathematics and Its Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542380"},{"key":"ref19","first-page":"239","article-title":"On the edge irregularity strength of disjoint union of graphs","volume":"142","author":"tarawneh","year":"2019","journal-title":"Ars Combinatoria"},{"key":"ref4","first-page":"17","article-title":"Iterative algorithm for computing irregularity strength of complete graph","volume":"138","author":"asim","year":"2018","journal-title":"Ars Combinatoria"},{"key":"ref3","first-page":"75","article-title":"Edge irregular k-labeling for several classes of trees","volume":"111","author":"asim","year":"2019","journal-title":"Utilitas Math"},{"key":"ref6","author":"buckley","year":"1990","journal-title":"Distance in Graphs"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10587-014-0080-2"},{"key":"ref7","first-page":"187","article-title":"Irregular networks","volume":"64","author":"chartrand","year":"1988","journal-title":"Congr Numer"},{"key":"ref2","first-page":"145","article-title":"Computing edge irregularity strength of complete m-ary trees using algorithmic approach","volume":"80","author":"ahmad","year":"2018","journal-title":"U P B Sci Bull Series A"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.06.028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2010.05.010"},{"key":"ref20","first-page":"93","article-title":"On the edge irregularity strength of disjoint union of star graph and subdivision of star graph","volume":"141","author":"tarawneh","year":"2018","journal-title":"Ars Combinatoria"},{"key":"ref21","first-page":"12","article-title":"Graph compositions: Deleting edges from complete graphs","volume":"15","author":"tichenor","year":"2015","journal-title":"Integers"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09352734.pdf?arnumber=9352734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:54:12Z","timestamp":1662670452000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9352734\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3058786","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}