{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:36:48Z","timestamp":1648852608653},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> A graph [Formula: see text] without isolated vertices is said to be a least common multiple of two graphs [Formula: see text] and [Formula: see text] if [Formula: see text] is a graph of minimum size such that [Formula: see text] is both [Formula: see text] decomposable and [Formula: see text] decomposable. Chartrand et al. proved that every two non-empty graphs [Formula: see text] and [Formula: see text] without isolated vertices have a least common multiple. Size of a least common multiple of [Formula: see text] and [Formula: see text] is denoted by [Formula: see text]. In this paper, least common multiple of some class of graphs are determined. <\/jats:p>","DOI":"10.1142\/s1793830916500324","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T03:31:17Z","timestamp":1457321477000},"page":"1650032","source":"Crossref","is-referenced-by-count":0,"title":["Least common multiple of graphs"],"prefix":"10.1142","volume":"08","author":[{"given":"T.","family":"Reji","sequence":"first","affiliation":[{"name":"Department of Mathematics, Government College, Chittur, Palakkad, Kerala 678104, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinitha","family":"Varughese","sequence":"additional","affiliation":[{"name":"Department of Mathematics, B. K. College, Amalagiri, Kottayam, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S1793830916500324BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2002.11.001"},{"key":"S1793830916500324BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01956769"},{"key":"S1793830916500324BIB003","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611502013771"},{"key":"S1793830916500324BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01876635"},{"key":"S1793830916500324BIB005","first-page":"181","volume":"43","author":"Favaron O.","year":"1996","journal-title":"Ars. Combin"},{"key":"S1793830916500324BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<361::AID-JGT5>3.0.CO;2-P"},{"key":"S1793830916500324BIB007","first-page":"117","volume":"46","author":"Mynhardt C. M.","year":"1994","journal-title":"Util. Math."},{"key":"S1793830916500324BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(81)90093-9"},{"key":"S1793830916500324BIB009","first-page":"231","volume":"53","author":"Wang P.","year":"1998","journal-title":"Util. Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:04:55Z","timestamp":1565139895000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S1793830916500324"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500324","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}