Leírás
University of Szeged, Bolyai Institute, Combinatorics Seminar
Abstract.
The Wiener index of a connected graph is the sum of distances for all unordered pairs of vertices. This is perhaps the most frequently used graph index in sciences, since Harold Wiener in 1947 observed that the Wiener index is closely correlated with the boiling points of alkane molecules. We determine asymptotically the maximum Wiener index of planar triangulations and quadrangulations on n vertices. We do the same for 4- and 5-connected triangulations and 3-connected quadrangulations as well. As triangulations are 3-connected and quadrangulations are 2-connected, the possibilities for connectivity are covered.
Exact conjectures are made for each of these problems, based on extensive computation. This is joint work with Éva Czabarka, Peter Dankelmann and Trevor Olsen.