{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:56:29Z","timestamp":1648824989107},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T00:00:00Z","timestamp":1337817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1193-8","type":"journal-article","created":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T13:55:33Z","timestamp":1337781333000},"page":"1569-1575","source":"Crossref","is-referenced-by-count":0,"title":["On the Edge Connectivity of Direct Products with Dense Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhidan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,24]]},"reference":[{"key":"1193_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.7151\/dmgt.1365","volume":"27","author":"B. Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar B., \u0160pacapan S.: Edge connectivity of strong products of graphs. Discuss. Math. Graph Theory 27, 333\u2013343 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1193_CR2","first-page":"45","volume":"41","author":"B. Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar B., \u0160pacapan S.: On the connectivity of the direct product of graphs. Australas. J. Combin. 41, 45\u201356 (2008)","journal-title":"Australas. J. Combin."},{"key":"1193_CR3","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ipl.2011.06.007","volume":"111","author":"X.L. Cao","year":"2011","unstructured":"Cao X.L., Brglez \u0160, \u0160pacapan S., Vumar E.: On edge connectivity of direct products of graphs. Inform. Process. Lett. 111, 899\u2013902 (2011)","journal-title":"Inform. Process. Lett."},{"key":"1193_CR4","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1016\/j.aml.2009.03.008","volume":"22","author":"R. Guji","year":"2009","unstructured":"Guji R., Vumar E.: A note on the connectivity of Kronecker products of graphs, Appl. Math. Lett. 22, 1360\u20131363 (2009)","journal-title":"Math. Lett."},{"key":"1193_CR5","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ipl.2010.05.013","volume":"110","author":"L.T. Guo","year":"2010","unstructured":"Guo L.T., Chen C.F., Guo X.F.: Super connectivity of Kronecker products of graphs. Inform. Process. Lett. 110, 659\u2013661 (2010)","journal-title":"Inform. Process. Lett."},{"key":"1193_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S1793557108000102","volume":"1","author":"S. Klav\u017ear","year":"2008","unstructured":"Klav\u017ear S., \u0160pacapan S.: On the edge-connectivity of Cartesian product graphs. Asian-Eur. J. Math. 1, 93\u201398 (2008)","journal-title":"Asian-Eur. J. Math."},{"key":"1193_CR7","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ipl.2007.12.002","volume":"106","author":"A. Mamut","year":"2008","unstructured":"Mamut A., Vumar E.: Vertex vulnerability parameters of Kronecker product of complete graphs. Inform. Process. Lett. 106, 258\u2013262 (2008)","journal-title":"Inform. Process. Lett."},{"key":"1193_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.disc.2010.12.012","volume":"311","author":"J.P. Ou","year":"2011","unstructured":"Ou J.P.: On optimizing edge connectivity of product graphs. Discrete Math. 311, 478\u2013492 (2011)","journal-title":"Discrete Math."},{"key":"1193_CR9","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ipl.2012.01.011","volume":"112","author":"H.C. Wang","year":"2012","unstructured":"Wang H.C., Shan E.F., Wang W.: On the super connectivity of Kronecker products of graphs. Inform. Process. Lett. 112, 402\u2013405 (2012)","journal-title":"Inform. Process. Lett."},{"key":"1193_CR10","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1016\/j.disc.2011.06.001","volume":"311","author":"Y. Wang","year":"2011","unstructured":"Wang Y., Wu B.: Proof of a conjecture on connectivity of Kronecker product of graphs. Discrete Math. 311, 2563\u20132565 (2011)","journal-title":"Discrete Math."},{"key":"1193_CR11","first-page":"107","volume":"100","author":"W. Wang","year":"2011","unstructured":"Wang W., Xue N.N.: Connectivity of direct products of graphs. Ars Combin. 100, 107\u2013111 (2011)","journal-title":"Ars Combin."},{"key":"1193_CR12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.aml.2011.08.009","volume":"25","author":"W. Wang","year":"2012","unstructured":"Wang W., Yan Z.D.: Connectivity of Kronecker products by K2. Appl. Math. Lett. 25, 172\u2013174 (2012)","journal-title":"Appl. Math. Lett."},{"key":"1193_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"P.M. Weichsel","year":"1962","unstructured":"Weichsel P.M.: The Kronecker product of graphs. Proc. Am. Math. Soc. 13, 47\u201352 (1962)","journal-title":"Proc. Am. Math. Soc."},{"key":"1193_CR14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.disc.2005.11.010","volume":"306","author":"J.M. Xu","year":"2006","unstructured":"Xu J.M., Yang C.: Connectivity of Cartesian products of graphs. Discrete Math. 306, 159\u2013165 (2006)","journal-title":"Discrete Math."},{"key":"1193_CR15","unstructured":"Yang, C., Xu, J.M.: Connectivity of lexicographic product and direct product of graphs, Ars Combin. (Accepted)"},{"key":"1193_CR16","first-page":"449","volume":"38","author":"C. Yang","year":"2008","unstructured":"Yang C., Xu J.M.: Connectivity and edge-connectivity of strong product graphs. J. Univ. Sci. Technol. China 38, 449\u2013453 (2008)","journal-title":"J. Univ. Sci. Technol. China"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1193-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1193-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1193-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1193-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,24]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1193"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1193-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,24]]}}}