{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:59:41Z","timestamp":1777705181730,"version":"3.51.4"},"reference-count":8,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,1,5]]},"abstract":"<jats:p>An one-one correspondence function \u03bb from V(G)\u00a0\u222a\u00a0E(G) to the set {1, 2, \u2026, |V(G)\u00a0|\u00a0+\u00a0|E(G)\u00a0|} is a total labeling of a finite undirected graph G without loops and multiple edges, where |V(G)\u00a0|and |E(G)\u00a0| are the cardinality of vertex and edge set of G respectively. A perfectly antimagic total labeling is a totally antimagic total labeling whose vertex and edge-weights that are also pairwise distint. Perfectly antimagic total (PAT) graph is a graph having such labeling. The topic of discovering perfectly antimagic total labeling of some families of graphs is discussed in this paper. We also came up with certain conclusions about dual of a perfectly antimagic total graphs. Finally, we provided that the necessary and sufficient condition for a dual of a regular and irregular PAT graph to be a PAT graph.<\/jats:p>","DOI":"10.3233\/jifs-221279","type":"journal-article","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T12:01:30Z","timestamp":1666353690000},"page":"1517-1523","source":"Crossref","is-referenced-by-count":0,"title":["Perfectly antimagic total graphs"],"prefix":"10.1177","volume":"44","author":[{"given":"P.","family":"Swathi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India"}]},{"given":"G.","family":"Kumar","sequence":"additional","affiliation":[{"name":"GHS, Parayankulam, Sivaganga, Tamilnadu, India"}]},{"given":"R.","family":"Jeyabalan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India"}]},{"given":"R.","family":"Nishanthini","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-221279_ref1","doi-asserted-by":"crossref","first-page":"6048","DOI":"10.1016\/j.disc.2009.05.005","article-title":"Super-vertex antimagic total labelings of disconnected graphs","volume":"309","author":"Ali","year":"2009","journal-title":"Discrete Math"},{"key":"10.3233\/JIFS-221279_ref2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.7151\/dmgt.1186","article-title":"Vertex-antimagic total labelings of graphs,","volume":"23","author":"Baca","year":"2003","journal-title":"Discuss Math Graph Theory"},{"issue":"1","key":"10.3233\/JIFS-221279_ref3","first-page":"42","article-title":"A. Abildgaard Sillasen, Totally antimagic total graphs,","volume":"61","author":"Baca","year":"2015","journal-title":"Australian J Combin"},{"key":"10.3233\/JIFS-221279_ref4","doi-asserted-by":"crossref","unstructured":"Cranston D.W. , Regular bipartite graphs are antimagic,, J Graph Theory (2009)","DOI":"10.1002\/jgt.20347"},{"key":"10.3233\/JIFS-221279_ref5","first-page":"DS6","article-title":"A Dynamic Survey of Graph Labeling","volume":"16","author":"Gallian","year":"2013","journal-title":"Electron J Combin"},{"key":"10.3233\/JIFS-221279_ref6","unstructured":"Hartsfield N. , Ringel G. Pearls in Graph Theory, Academic Press, Boston \u2013 San Diego \u2013 New York \u2013 London, 1990."},{"key":"10.3233\/JIFS-221279_ref7","doi-asserted-by":"crossref","unstructured":"Marimuthu G.T. and Kumar G. , Solution to some open problems on E-super vertex mgic labeling of disconnected graphs, Appl Math Comput, 268 (2015), 657\u2013663.","DOI":"10.1016\/j.amc.2015.06.096"},{"key":"10.3233\/JIFS-221279_ref8","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.endm.2011.10.008","article-title":"All graphs have antimagic total labelings,","author":"Miller","year":"2011","journal-title":"Electron Notes in Discrete Math"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-221279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:07Z","timestamp":1777455787000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-221279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,5]]},"references-count":8,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-221279","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,5]]}}}