{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T02:53:26Z","timestamp":1768877606766,"version":"3.49.0"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p> The product degree distance of a connected graph [Formula: see text] is defined as [Formula: see text] where [Formula: see text] is the degree of a vertex [Formula: see text] and [Formula: see text] is the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text] In this paper, we obtain two upper bounds for product degree distance of [Formula: see text]-sums of graphs which is defined by Eliasi [Four new sums of graphs and their Wiener indices, Discr. Appl. Math. 157 (2009) 794\u2013803.] <\/jats:p>","DOI":"10.1142\/s1793830919500459","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T08:54:53Z","timestamp":1562316893000},"page":"1950045","source":"Crossref","is-referenced-by-count":3,"title":["Upper bounds on product degree distance of F-sum of graphs"],"prefix":"10.1142","volume":"11","author":[{"given":"K.","family":"Pattabiraman","sequence":"first","affiliation":[{"name":"Department of Mathematics, Annamalai University, Annamalainagar 608 002, India"}]},{"given":"Manzoor Ahmad","family":"Bhat","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Annamalai University, Annamalainagar 608 002, India"}]}],"member":"219","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"S1793830919500459BIB001","first-page":"515","volume":"67","author":"Andova V.","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830919500459BIB002","volume-title":"Topological Indices and Related Descriptors in QSAR and QSPR","author":"Devillers J.","year":"1999"},{"key":"S1793830919500459BIB003","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a008"},{"key":"S1793830919500459BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.07.001"},{"key":"S1793830919500459BIB005","first-page":"699","volume":"66","author":"Feng L.","year":"2011","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830919500459BIB006","volume":"4","author":"Feng L.","year":"2012","journal-title":"Discr. Math. Algorithms Appl."},{"key":"S1793830919500459BIB007","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a009"},{"key":"S1793830919500459BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-70982-1"},{"key":"S1793830919500459BIB009","first-page":"579","volume":"3","author":"Minigqiang An.","year":"2014","journal-title":"Filomat"},{"key":"S1793830919500459BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.06.031"},{"key":"S1793830919500459BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2006.04.010"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T01:59:37Z","timestamp":1568685577000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":11,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S1793830919500459"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500459","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}