ARTICLE
TITLE

Proximity in triangulations and quadrangulations

SUMMARY

Let G be a connected graph. If s(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the proximity, p(G), of G is defined as the smallest value of s(v) over all vertices v of G. We give upper bounds for the proximity of simple triangulations and quadrangulations of given order and connectivity. We also construct simple triangulations and quadrangulations of given order and connectivity that match the upper bounds asymptotically and are likely optimal.

PAGES
pp. 425 - 446

 Articles related

Mehmet Hakan Karaata    

In this paper, we first coin a new graph theoretic problem called the diameter cycle problem with numerous applications. A longest cycle in a graph G = (V, E) is referred to as a diameter cycle of G iff the distance in G of every vertex on... see more


Fitri Retnananing Siwi, S. Sudarmadji, S. Suratno    

The mangrove forest is one of the coastal ecosystems of unique and productive. One of the animals that can be found in the mangrove ecosystem are gastropods. Gastropods constitute the largest class of the phylum of mollusks. Gastropods can usually be fou... see more


G. M. Shilo,O. V. Sirotuk,?. E. Savello,J. A. Lopatka,E. K. Areshkin,M. P. Gaponenko    

The dependence of volume, mass and size on the number of boards and the distance between them in sealed unit of electronic devices is researched. Mass and size characteristics are calculated excluding the mass of electronic components, wiring harness and... see more


Della Vinka Sandi, Muhammad Arrofiq    

Indonesia is one of agrarian countris which has a fertile soil condition, but the agricultural products nowadays are not maximal in certain areas particularly strawberry plantation. Strawberry plant it self needs precise temperature and humidity level to... see more