An asymptotic relation between the wirelength of an embedding and the Wiener indexKumar, K. Jagadeesh (Avtor) Klavžar, Sandi (Avtor) Rajan, R. Sundara (Avtor) Rajasingh, Indra (Avtor) Rajalaxmi, T. M. (Avtor) Wiener indexembeddingwirelengthcomplete 2p-partite graphCartesian product of graphsinteger labelingWirelength is an important criterion to validate the quality of an embedding of a graph into a host graph and is used in particular in VLSI (Very-Large-Scale Integration) layout designs. Wiener index plays a significant role in mathematical chemistry, cheminformatics, and elsewhere. In this note these two concepts are related by proving that the Wiener index of a host graph is an upper bound for the wirelength of a given embedding. The wirelength of embedding complete ▫$2^p$▫-partite graphs into Cartesian products of paths and/or cycles as the function of the Wiener index is determined. The result is an asymptotic approximation of the general upper bound.National University of Computer and Emerging Science, University of Management and Technology, University of Management and Technology20212024-09-23 11:18:41Znanstveno delo90784UDK: 519.17COBISS_ID: 70732035DOI: 10.47443/dml.2021.0063ISSN pri članku: 2664-2557sl