{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T16:56:27Z","timestamp":1758473787294},"reference-count":17,"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":[[2014,3]]},"abstract":"<jats:p> We determine the exact value of the degree distance of the cartesian product and the wreath product of two graphs. Also we apply our results to compute the exact degree distance of hypercube, torus, grid, Hamming graph and fence graph. <\/jats:p>","DOI":"10.1142\/s1793830914500037","type":"journal-article","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T20:59:09Z","timestamp":1383166749000},"page":"1450003","source":"Crossref","is-referenced-by-count":5,"title":["DEGREE DISTANCE OF PRODUCT GRAPHS"],"prefix":"10.1142","volume":"06","author":[{"given":"P.","family":"PAULRAJA","sequence":"first","affiliation":[{"name":"Department of Mathematics, Annamalai University, Annamalainagar \u2014 608 002, India"}]},{"given":"V. S.","family":"AGNES","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Annamalai University, Annamalainagar \u2014 608 002, India"}]}],"member":"219","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4529-6"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"rf3","first-page":"649","volume":"5","author":"Chen S.","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.04.006"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a008"},{"key":"rf6","first-page":"122","volume":"30","author":"Essalih M.","journal-title":"J. Theoretical Appl. Inf. Tech."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a009"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1063\/1.430994"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"rf10","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"Hammack R.","year":"2011"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2008.03.003"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.015"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.10.020"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-461X(1996)60:5<959::AID-QUA2>3.0.CO;2-W"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1021\/ci00063a012"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00117-1"},{"key":"rf17","volume-title":"Chemical Graph Theory","author":"Trinajsti\u0107 N.","year":"1983"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:59:15Z","timestamp":1565099955000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":17,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,2,18]]},"published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1142\/S1793830914500037"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500037","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}