{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:08:24Z","timestamp":1742954904335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_23","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T02:42:00Z","timestamp":1502851320000},"page":"175-181","source":"Crossref","is-referenced-by-count":0,"title":["Irregularity Strength of Corona of Two Graphs"],"prefix":"10.1007","author":[{"given":"K. Muthu Guru","family":"Packiam","sequence":"first","affiliation":[]},{"given":"T.","family":"Manimaran","sequence":"additional","affiliation":[]},{"given":"A.","family":"Thuraiswamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discrete Math. 3, 439\u2013449 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"3461","DOI":"10.1016\/j.disc.2012.06.017","volume":"312","author":"M Anholcer","year":"2012","unstructured":"Anholcer, M., Palmer, C.: Irregular labellings of circulant graphs. Discrete Math. 312, 3461\u20133466 (2012)","journal-title":"Discrete Math."},{"key":"23_CR3","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":"23_CR4","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":"23_CR5","first-page":"39","volume":"71","author":"G Ebert","year":"1990","unstructured":"Ebert, G., Hemmeter, J., Lazebnik, F., Wolder, A.: Irregularity strength for certain graphs. Congr. Numer. 71, 39\u201352 (1990)","journal-title":"Congr. Numer."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(89)90321-X","volume":"76","author":"RJ Faudree","year":"1989","unstructured":"Faudree, R.J., Schelp, R.H., Jacobson, M.S., Lehel, J.: Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Math. 76, 223\u2013240 (1989)","journal-title":"Discrete Math."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1002\/jgt.10056","volume":"41","author":"A Frieze","year":"2002","unstructured":"Frieze, A., Gould, R.J., Karonski, M., Pfender, F.: On graph irregularity strength. J. Graph Theory 41, 120\u2013137 (2002)","journal-title":"J. Graph Theory"},{"key":"23_CR8","unstructured":"Jinnah, M.I., Santhosh Kumar, K.R.: Irregularity strength of corona product of two graphs. In: Proceedings of National Seminar on Algebra, Analysis and Discrete Mathematics, pp. 191\u2013199. University of Kerala, Thiruvananthapuram, Kerala (2012)"},{"issue":"3","key":"23_CR9","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski, M., Karonski, M., Pfender, F.: A new upper bound for the irregularity strength of graphs. SIAM J. Discrete Math. 25(3), 1319\u20131321 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/120886650","volume":"28","author":"P Majerski","year":"2014","unstructured":"Majerski, P., Przybylo, J.: On the irregularity strength of dense graphs. SIAM J. Discrete Math. 28(1), 197\u2013205 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR11","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. Discrete Math. 13, 313\u2013323 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Przybylo, J.: Irregularity strength of regular graphs. Electron. J. Combin. 15 (2008). R82","DOI":"10.37236\/806"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T08:34:49Z","timestamp":1602750889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}