{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:14:18Z","timestamp":1648678458278},"reference-count":9,"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":[[2019,2]]},"abstract":"<jats:p>The distinguishing number (index) [Formula: see text] ([Formula: see text]) of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a vertex (edge) labeling with [Formula: see text] labels that is preserved only by a trivial automorphism. In this paper, we consider the maximal outerplanar graphs (MOP graphs) and show that MOP graphs, except [Formula: see text], can be distinguished by at most two vertex (edge) labels. We also compute the distinguishing number and the distinguishing index of Halin and Mycielskian graphs.<\/jats:p>","DOI":"10.1142\/s1793830919500083","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T06:19:11Z","timestamp":1542349151000},"page":"1950008","source":"Crossref","is-referenced-by-count":1,"title":["Symmetry breaking in planar and maximal outerplanar graphs"],"prefix":"10.1142","volume":"11","author":[{"given":"Saeid","family":"Alikhani","sequence":"first","affiliation":[{"name":"Department of Mathematics, Yazd University, 89195-741, Yazd, Iran"}]},{"given":"Samaneh","family":"Soltani","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Yazd University, 89195-741, Yazd, Iran"}]}],"member":"219","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"issue":"1","key":"S1793830919500083BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1242","volume":"3","author":"Albertson M. O.","year":"1996","journal-title":"Electron. J. Combin."},{"key":"S1793830919500083BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/07068686X"},{"key":"S1793830919500083BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591867"},{"key":"S1793830919500083BIB005","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.199.a0e"},{"key":"S1793830919500083BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2014.11.003"},{"key":"S1793830919500083BIB007","doi-asserted-by":"publisher","DOI":"10.4064\/cm-3-2-161-162"},{"key":"S1793830919500083BIB008","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.981.ff0"},{"key":"S1793830919500083BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/BF00995176"},{"key":"S1793830919500083BIB010","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190040108"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T10:10:16Z","timestamp":1605435016000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,2,8]]},"published-print":{"date-parts":[[2019,2]]}},"alternative-id":["10.1142\/S1793830919500083"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500083","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}