Showing papers by "Andrey A. Dobrynin published in 2002"
TL;DR: In this paper, the authors present the results known for W of the HS: method for computing W, expressions relating W with the structure of the respective HS, results on HS's extremal w.r.t. W, and on integers that cannot be the W-values of HS's.
Abstract: The Wiener index W is the sum of distances between all pairs of vertices of a (connected) graph. Hexagonal systems (HS's) are a special type of plane graphs in which all faces are bounded by hexagons. These provide a graph representation of benzenoid hydrocarbons and thus find applications in chemistry. The paper outlines the results known for W of the HS: method for computation of W, expressions relating W with the structure of the respective HS, results on HS's extremal w.r.t. W, and on integers that cannot be the W-values of HS's. A few open problems are mentioned. The chemical applications of the results presented are explained in detail.
371 citations
TL;DR: A k-gon alpha of a polyhedral graph G(V,E,F) is of type if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and $ is the lexicographic minimum of all such sequences available for alpha.
Abstract: A k-gon alpha of a polyhedral graph G(V,E,F) is of type if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and $ is the lexicographic minimum of all such sequences available for alpha. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.
2 citations