Abstract
Sharp lower and upper bounds for the Wiener index (W) of a connected (n, m)-graph are reported; n = number of vertices, m = number of edges. The mean isomer degeneracy of W is estimated and is shown to unboundedly increase with increasing n. Thus the isomer-discriminating power of W is confirmed to be very low in the case of large molecules.
Received: 1991-2-19
Published Online: 2014-6-2
Published in Print: 1991-10-1
© 1946 – 2014: Verlag der Zeitschrift für Naturforschung
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
