{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:54:24Z","timestamp":1712303664967},"reference-count":21,"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":[[2016,3]]},"abstract":"<jats:p>The concept of monochromatic connectivity was introduced by Caro and Yuster. A path in an edge-colored graph is called a monochromatic path if all the edges on the path are colored the same. An edge-coloring of [Formula: see text] is a monochromatic connection coloring ([Formula: see text]-coloring, for short) if there is a monochromatic path joining any two vertices in [Formula: see text]. The monochromatic connection number, denoted by [Formula: see text], is defined to be the maximum number of colors used in an [Formula: see text]-coloring of a graph [Formula: see text]. In this paper, we study the monochromatic connection number on the lexicographical, strong, Cartesian and direct products and present several upper and lower bounds for these products of graphs.<\/jats:p>","DOI":"10.1142\/s1793830916500117","type":"journal-article","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T09:19:43Z","timestamp":1448270383000},"page":"1650011","source":"Crossref","is-referenced-by-count":3,"title":["Monochromatic connectivity and graph products"],"prefix":"10.1142","volume":"08","author":[{"given":"Yaping","family":"Mao","sequence":"first","affiliation":[{"name":"Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China"},{"name":"School of Mathematical Sciences, Beijing Normal University, Beijing 100875, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengnan","family":"Yanling","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfu","family":"Ye","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"S1793830916500117BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-011-1031-4"},{"key":"S1793830916500117BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00100-5"},{"key":"S1793830916500117BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830916500117BIB006","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528993X"},{"key":"S1793830916500117BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.04.020"},{"key":"S1793830916500117BIB008","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"Chartrand G.","year":"2008","journal-title":"Math. Bohem."},{"key":"S1793830916500117BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/net.20296"},{"key":"S1793830916500117BIB010","first-page":"360","volume":"55","author":"Chartrand G.","year":"2010","journal-title":"Networks"},{"key":"S1793830916500117BIB011","doi-asserted-by":"publisher","DOI":"10.1155\/1995\/95759"},{"key":"S1793830916500117BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/71.577251"},{"key":"S1793830916500117BIB013","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0012"},{"key":"S1793830916500117BIB015","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"Hammack R.","year":"2011","edition":"2"},{"key":"S1793830916500117BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"S1793830916500117BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"S1793830916500117BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557108000102"},{"key":"S1793830916500117BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-012-1243-2"},{"key":"S1793830916500117BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0"},{"key":"S1793830916500117BIB022","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20265"},{"key":"S1793830916500117BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.06.010"},{"key":"S1793830916500117BIB024","first-page":"3","volume":"111","author":"Yang C.","year":"2013","journal-title":"Ars Combin."},{"key":"S1793830916500117BIB025","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20338"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T18:21:08Z","timestamp":1599848468000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":21,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,2,26]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S1793830916500117"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500117","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}