{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:18:49Z","timestamp":1648729129905},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T00:00:00Z","timestamp":1430956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11786-015-0229-x","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T11:39:18Z","timestamp":1430912358000},"page":"229-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Total Irregularity Strength of Three Families of Graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Rismawati","family":"Ramdani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. N. M.","family":"Salman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilda","family":"Assiyatun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Ba\u010da","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,7]]},"reference":[{"key":"229_CR1","first-page":"129","volume":"112","author":"A. Ahmad","year":"2013","unstructured":"Ahmad A., Ba\u010da M.: On vertex irregular total labelings. Ars Combin. 112, 129\u2013139 (2013)","journal-title":"Ars Combin."},{"key":"229_CR2","first-page":"203","volume":"114","author":"A. Ahmad","year":"2014","unstructured":"Ahmad A., Ba\u010da M.: Total edge irregularity strength of a categorical product of two paths. Ars Comb. 114, 203\u2013212 (2014)","journal-title":"Ars Comb."},{"key":"229_CR3","first-page":"449","volume":"106","author":"A. Ahmad","year":"2012","unstructured":"Ahmad A., Ba\u010da M., Bashir Y., Siddiqui M.K.: Total edge irregularity strength of strong product of two paths. Ars Comb. 106, 449\u2013459 (2012)","journal-title":"Ars Comb."},{"issue":"1","key":"229_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00224-013-9470-3","volume":"54","author":"A. Ahmad","year":"2014","unstructured":"Ahmad A., Ba\u010da M., Siddiqui M.K.: On edge irregular total labeling of categorical product of two cycles. Theory Comput. Syst. 54(1), 1\u201312 (2014)","journal-title":"Theory Comput. Syst."},{"key":"229_CR5","doi-asserted-by":"crossref","first-page":"6316","DOI":"10.1016\/j.disc.2009.05.023","volume":"309","author":"M. Anholcer","year":"2009","unstructured":"Anholcer M., Kalkowski M., Przybylo J.: A new upper bound for the total vertex irregularity strength of graphs. Discret. Math. 309, 6316\u20136317 (2009)","journal-title":"Discret. Math."},{"key":"229_CR6","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1016\/j.disc.2005.11.075","volume":"307","author":"M. Ba\u010da","year":"2007","unstructured":"Ba\u010da M., Jendro\u013e S., Miller M., Ryan J.: On irregular total labellings. Discret. Math. 307, 1378\u20131388 (2007)","journal-title":"Discret. Math."},{"key":"229_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s11786-014-0172-2","volume":"7","author":"M. Ba\u010da","year":"2013","unstructured":"Ba\u010da M., Lascs\u00e1kov\u00e1 M., Siddiqui M.K.: Total edge irregularity strength of toroidal fullerene. Math. Comput. Sci. 7, 487\u2013492 (2013)","journal-title":"Math. Comput. Sci."},{"key":"229_CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.amc.2014.03.001","volume":"235","author":"M. Ba\u010da","year":"2014","unstructured":"Ba\u010da M., Siddiqui M.K.: Total edge irregularity strength of generalized prism. Appl. Math. Comput. 235, 168\u2013173 (2014)","journal-title":"Appl. Math. Comput."},{"key":"229_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.10158","volume":"45","author":"T. Bohman","year":"2004","unstructured":"Bohman T., Kravitz D.: On the irregularity strength of trees. J. Graph Theory 45, 241\u2013254 (2004)","journal-title":"J. Graph Theory"},{"key":"229_CR10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/jgt.20287","volume":"57","author":"S. Brandt","year":"2008","unstructured":"Brandt S., Mi\u0161kuf J., Rautenbach D.: On a conjecture about edge irregular total labellings. J. Graph Theory 57, 333\u2013343 (2008)","journal-title":"J. Graph Theory"},{"key":"229_CR11","first-page":"187","volume":"64","author":"G. Chartrand","year":"1988","unstructured":"Chartrand G., Jacobson M.S., Lehel J., Oellermann O.R., Ruiz S., Saba F.: Irregular networks. Congr. Numer. 64, 187\u2013192 (1988)","journal-title":"Congr. Numer."},{"key":"229_CR12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s00224-011-9350-7","volume":"50","author":"M.K.M. Haque","year":"2012","unstructured":"Haque M.K.M.: Irregular total labellings of generalized Petersen graphs. Theory Comput. Syst. 50, 537\u2013544 (2012)","journal-title":"Theory Comput. Syst."},{"key":"229_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.7151\/dmgt.1337","volume":"26","author":"J. Ivan\u010do","year":"2006","unstructured":"Ivan\u010do J., Jendro\u013e S.: Total edge irregularity strength of trees. Discuss. Math. Graph Theory 26, 449\u2013456 (2006)","journal-title":"Discuss. Math. Graph Theory"},{"key":"229_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.endm.2007.01.041","volume":"28","author":"S. Jendro\u013e","year":"2007","unstructured":"Jendro\u013e S., Mi\u0161kuf J., Sot\u00e1k R.: Total edge irregularity strength of complete and complete bipartite graphs. Electron. Notes Discret. Math. 28, 281\u2013285 (2007)","journal-title":"Electron. Notes Discret. Math."},{"key":"229_CR15","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.disc.2009.03.006","volume":"310","author":"S. Jendro\u013e","year":"2010","unstructured":"Jendro\u013e S., Mi\u0161kuf J., Sot\u00e1k R.: Total edge irregularity strength of complete graphs and complete bipartite graphs. Discret. Math. 310, 400\u2013407 (2010)","journal-title":"Discret. Math."},{"issue":"1","key":"229_CR16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/jgt.21748","volume":"76","author":"P. Majerski","year":"2014","unstructured":"Majerski P., Przybylo J.: Total vertex irregularity strength of dense graphs. J. Graph Theory. 76(1), 34\u201341 (2014)","journal-title":"J. Graph Theory."},{"issue":"1","key":"229_CR17","first-page":"1","volume":"82","author":"C.C. Marzuki","year":"2013","unstructured":"Marzuki C.C., Salman A.N.M., Miller M.: On the total irregularity strength on cycles and paths. Far East J. Math. Sci. 82(1), 1\u201321 (2013)","journal-title":"Far East J. Math. Sci."},{"key":"229_CR18","first-page":"147","volume":"36","author":"J. Mi\u0161kuf","year":"2007","unstructured":"Mi\u0161kuf J., Jendro\u013e S.: On total edge irregularity strength of the grids. Tatra Mt. Math. Publ. 36, 147\u2013151 (2007)","journal-title":"Tatra Mt. Math. Publ."},{"key":"229_CR19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T. Nierhoff","year":"2000","unstructured":"Nierhoff T.: A tight bound on the irregularity strength of graphs. SIAM J. Discret. Math. 13, 313\u2013323 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"229_CR20","first-page":"163","volume":"65","author":"Nurdin","year":"2008","unstructured":"Nurdin, Salman A.N.M., Baskoro E.T.: The total edge-irregular strengths of the corona product of paths with some graphs. J. Comb. Math. Comb. Comput. 65, 163\u2013175 (2008)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"229_CR21","doi-asserted-by":"crossref","first-page":"3043","DOI":"10.1016\/j.disc.2010.06.041","volume":"310","author":"Nurdin","year":"2010","unstructured":"Nurdin, Baskoro E.T., Salman A.N.M., Gaos N.N.: On the total vertex irregularity strength of trees. Discret. Math. 310, 3043\u20133048 (2010)","journal-title":"Discret. Math."},{"key":"229_CR22","first-page":"277","volume":"83","author":"Nurdin","year":"2010","unstructured":"Nurdin, Baskoro E.T., Salman A.N.M., Gaos N.N.: On the total vertex irregular labelings for several types of trees. Util. Math. 83, 277\u2013290 (2010)","journal-title":"Util. Math."},{"key":"229_CR23","first-page":"227","volume":"71","author":"Nurdin","year":"2009","unstructured":"Nurdin, Salman A.N.M., Gaos N.N., Baskoro E.T.: On the total vertex-irregular strength of a disjoint union of t copies of a path. J. Combin. Math. Combin. Comput. 71, 227\u2013233 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"229_CR24","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/070707385","volume":"23","author":"J. Przybylo","year":"2009","unstructured":"Przybylo J.: Linear bound on the irregularity strength and the total vertex irregularity strength of graphs. SIAM J. Discret. Math. 23, 511\u2013516 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"229_CR25","first-page":"199","volume":"10","author":"R. Ramdani","year":"2013","unstructured":"Ramdani R., Salman A.N.M.: On the total irregularity strength of some Cartesian product graphs. AKCE Int. J. Graphs Comb. 10(2), 199\u2013209 (2013)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"229_CR26","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/S0012-365X(96)00207-5","volume":"165\/166","author":"O. Togni","year":"1997","unstructured":"Togni O.: Irregularity strength of the toroidal grid. Discret. Math. 165\/166, 609\u2013620 (1997)","journal-title":"Discret. Math."},{"key":"229_CR27","first-page":"103","volume":"65","author":"K. Wijaya","year":"2008","unstructured":"Wijaya K., Wijaya K.: Total vertex irregular labeling of wheels, fans, suns and friendship graphs. J. Comb. Math. Comb. Comput. 65, 103\u2013112 (2008)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"229_CR28","first-page":"129","volume":"55","author":"K. Wijaya","year":"2005","unstructured":"Wijaya K., Slamin, Surahmat, Jendro\u013e S.: Total vertex irregular labeling of complete bipartite graphs. J. Comb. Math. Comb. Comput. 55, 129\u2013136 (2005)","journal-title":"J. Comb. Math. Comb. Comput."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0229-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-015-0229-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-015-0229-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:35:11Z","timestamp":1559428511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-015-0229-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,7]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s11786-015-0229-x","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,7]]}}}