{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:28Z","timestamp":1753885708973,"version":"3.41.2"},"reference-count":28,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"crossref","award":["ECR\/2016\/1993"],"award-info":[{"award-number":["ECR\/2016\/1993"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p> Embeddings are often viewed as a high-level representation of systematic methods to simulate an algorithm designed for one kind of parallel machine on a different network structure and\/or techniques to distribute data\/program variables to achieve optimum use of all available processors. A topological index is a numeric quantity of a molecule that is mathematically derived in an unambiguous way from the structural graph of a molecule. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. Arguably, the best known of these indices is the Wiener index, defined as the sum of all distances between distinct vertices. In this paper, we have obtained the exact wirelength of embedding Cartesian products of complete graphs into a Cartesian product of paths and cycles, and generalized book. In addition to that, we have found the Wiener index of generalized book and the relation between the Wiener index and wirelength of an embedding, which solves (partially) an open problem proposed in Kumar et\u00a0al. [K. J. Kumar, S. Klav\u017ear, R. S. Rajan, I. Rajasingh and T. M. Rajalaxmi, An asymptotic relation between the wirelength of an embedding and the Wiener index, submitted to the journal]. <\/jats:p>","DOI":"10.1142\/s1793830921500877","type":"journal-article","created":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T04:37:30Z","timestamp":1614314250000},"source":"Crossref","is-referenced-by-count":2,"title":["Wiener index via wirelength of an embedding"],"prefix":"10.1142","volume":"14","author":[{"given":"G. Kirithiga","family":"Nandini","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Hindustan Institute of Technology and Science, Chennai 603 103, India"}]},{"given":"R. Sundara","family":"Rajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai 603 110, India"}]},{"given":"A. Arul","family":"Shantrinal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India"}]},{"given":"Sharifah Kartini Said","family":"Husain","sequence":"additional","affiliation":[{"name":"Institute for Mathematical Research and Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia"}]},{"given":"Roslan","family":"Hasni","sequence":"additional","affiliation":[{"name":"Faculty of Ocean Engineering Technology and Informatics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia"}]}],"member":"219","published-online":{"date-parts":[[2021,2,24]]},"reference":[{"key":"S1793830921500877BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_13"},{"key":"S1793830921500877BIB003","first-page":"693","volume-title":"Lecture Notes in Computer Science","author":"Bezrukov S. L.","year":"1998"},{"key":"S1793830921500877BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00139-8"},{"key":"S1793830921500877BIB005","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:19982341"},{"key":"S1793830921500877BIB006","first-page":"335","volume-title":"Proc. Int. Conf. Parallel Processing","author":"Tzeng N. F.","year":"1990"},{"key":"S1793830921500877BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1991.153813"},{"key":"S1793830921500877BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.06.039"},{"key":"S1793830921500877BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-018-2612-2"},{"key":"S1793830921500877BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1893-0"},{"volume-title":"Proc. Eighth Int. Conf. High-Performance Computing in Asia-Pacific Region","year":"2005","author":"Fang J-F.","key":"S1793830921500877BIB011"},{"volume-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S1793830921500877BIB012"},{"key":"S1793830921500877BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s000260050003"},{"key":"S1793830921500877BIB014","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679"},{"key":"S1793830921500877BIB015","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu031"},{"key":"S1793830921500877BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"S1793830921500877BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.06.011"},{"key":"S1793830921500877BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.034"},{"key":"S1793830921500877BIB019","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"issue":"3","key":"S1793830921500877BIB020","first-page":"26","volume":"138","author":"Maheswari S. U.","year":"2016","journal-title":"Int. J. Comput. Appl."},{"key":"S1793830921500877BIB021","first-page":"217","volume":"47","author":"Cockayne E. J.","year":"1985","journal-title":"Congressus Numerantium"},{"key":"S1793830921500877BIB022","first-page":"48","volume-title":"Lecture Notes in Computer Science","author":"Zhao F.","year":"2011"},{"key":"S1793830921500877BIB023","first-page":"792","volume":"4","author":"Ghadi N.","year":"2017","journal-title":"Int. \u201cRes. J. Eng. Technol."},{"issue":"3","key":"S1793830921500877BIB024","first-page":"1","volume":"57","author":"Klav S.","year":"2007","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830921500877BIB025","first-page":"133","volume":"135","author":"Rajan R. S.","year":"2017","journal-title":"Ars Combinatoria"},{"key":"S1793830921500877BIB026","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxw046"},{"key":"S1793830921500877BIB027","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1964.11992272"},{"key":"S1793830921500877BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/BF01166923"},{"key":"S1793830921500877BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)E0092-I"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T10:17:52Z","timestamp":1645006672000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,24]]},"references-count":28,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1142\/S1793830921500877"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500877","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,2,24]]},"article-number":"2150087"}}