{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:49Z","timestamp":1720640689734},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1571-0653(04)00581-5","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"202-204","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Least Common Multiple of a Cycle and a Star"],"prefix":"10.1016","volume":"15","author":[{"given":"C.","family":"Simil kumar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0653(04)00581-5_BIB1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01876635","article-title":"Greatest common divisors and Least common multiples of graphs","volume":"27","author":"Chartrand","year":"1993","journal-title":"Periodica Mathematica Hungarica"},{"key":"10.1016\/S1571-0653(04)00581-5_BIB2","unstructured":"G. Chartrand and L. Lesniak (1986). Graphs and Digraphs (Second edition), Wordsworth and Brookes\/Cole Monetary."},{"key":"10.1016\/S1571-0653(04)00581-5_BIB3","first-page":"243","article-title":"Isomorphic factorization I: Complete graphs","volume":"242","author":"Harary","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S1571-0653(04)00581-5_BIB4","first-page":"231","article-title":"On the Sizes of Least Common Multiples of Stars Versus Cycles","volume":"53","author":"Wang","year":"1998","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/S1571-0653(04)00581-5_BIB5","first-page":"647","author":"Wilson","year":"1975","journal-title":"Decomposition of Complete graphs into subgraphs isomorphic to given graph, Proceedings of the Fifth British Combinatorial Conference"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304005815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304005815?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:52:41Z","timestamp":1548597161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304005815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":5,"alternative-id":["S1571065304005815"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00581-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}