{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T17:18:17Z","timestamp":1717435097092},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,3]]},"abstract":"<jats:p> Let \u2115<jats:sub>0<\/jats:sub> be the set of all non-negative integers. An integer additive set-indexer (IASI) of a graph G is an injective function f : V(G) \u2192 2<jats:sup>\u2115<jats:sub>0<\/jats:sub><\/jats:sup> such that the induced function g<jats:sub>f<\/jats:sub> : E(G) \u2192 2<jats:sup>\u2115<jats:sub>0<\/jats:sub><\/jats:sup> defined by f<jats:sup>+<\/jats:sup>(uv) = f(u) + f(v) is also injective. An IASI is said to be k-uniform if |f<jats:sup>+<\/jats:sup>(e)| = k for all e \u2208 E(G). In this paper, we introduce the notions of strong IASIs and initiate a study of the graphs which admit strong IASIs. <\/jats:p>","DOI":"10.1142\/s1793830914500657","type":"journal-article","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T08:44:37Z","timestamp":1410857077000},"page":"1450065","source":"Crossref","is-referenced-by-count":7,"title":["Some new results on strong integer additive set-indexers of graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"N. K.","family":"Sudev","sequence":"first","affiliation":[{"name":"Department of Mathematics, Vidya Academy of Science &amp; Technology, Thalakkottukara, Thrissur 680501, Kerala, India"}]},{"given":"K. A.","family":"Germina","sequence":"additional","affiliation":[{"name":"PG &amp; Research Department of Mathematics, Mary Matha Arts &amp; Science College, Manathavady, Wayanad 670645, Kerala, India"}]}],"member":"219","published-online":{"date-parts":[[2015,2,2]]},"reference":[{"key":"rf1","series-title":"MRI Lecture Notes in Applied Mathematics","volume-title":"Set-Valuations and Their Applications","author":"Acharya B. D.","year":"1983"},{"key":"rf2","first-page":"1","volume":"16","author":"Acharya B. D.","year":"2001","journal-title":"Bull. Allahabad Math. Soc."},{"key":"rf3","first-page":"3","volume":"15","author":"Acharya B. D.","year":"2013","journal-title":"Adv. Model. Optim."},{"key":"rf4","unstructured":"B. D.\u00a0Acharya, K. A.\u00a0Germina and T. M. K.\u00a0Anandavally, Labeling of Discrete Structures and Applications, eds. B. D.\u00a0Acharya, S.\u00a0Arumugam and A.\u00a0Rosa (Narosa Publishing House, New Delhi, 2008)\u00a0pp. 41\u201346."},{"key":"rf5","volume-title":"The Mathematical Coloring Book","author":"Alexander S.","year":"2008"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.12988\/ijcms.2013.13045"},{"key":"rf7","volume-title":"Introduction to Analytic Number Theory","author":"Apostol T. M.","year":"1989"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"rf10","volume-title":"Elementary Number Theory","author":"Burton D. M.","year":"2007"},{"key":"rf11","volume-title":"Introduction to Graph Theory","author":"Chartrand G.","year":"2005"},{"key":"rf12","volume-title":"Graph Theory","author":"Diestel R.","year":"2000"},{"key":"rf13","first-page":"DS6","volume":"18","author":"Gallian J. A.","year":"2013","journal-title":"Electron. J. Combin."},{"key":"rf15","first-page":"17","volume":"2012","author":"Germina K. A.","year":"2012","journal-title":"J. Fuzzy Set Valued Anal."},{"key":"rf16","first-page":"345","volume":"37","author":"Germina K. A.","year":"2012","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.12988\/imf.2013.310188"},{"key":"rf18","volume-title":"Graph Theory and Its Applications","author":"Gross J.","year":"1999"},{"key":"rf19","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"rf20","volume-title":"Applied Discrete Structures","author":"Joshi K. D.","year":"2003"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3845-2"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970401"},{"key":"rf23","volume-title":"Theory of Graphs","author":"Rosa A.","year":"1967"},{"key":"rf24","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:25:18Z","timestamp":1565151918000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,2]]},"references-count":23,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2015,2,2]]},"published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1142\/S1793830914500657"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500657","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,2]]}}}