Proximity in Triangulations and Quadrangulations

2020/01/23 by Czabarka, Éva, Dankelmann, Peter, Olsen, Trevor +1 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2001.09012

Abstract

Let G be a connected graph. If σ(v) denotes the arithmetic mean of the distances from v to all other vertices of G, then the proximity, π(G), of G is defined as the smallest value of σ(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.

Cited by

• On Proximity and other Distance Parameters in Planar Graphs

Related

• On Proximity and other Distance Parameters in Planar Graphs
• On the difference between proximity and other distance parameters in triangle-free graphs and C₄-free graphs
• Proximity and remoteness in triangle-free and C₄-free graphs in terms\n of order and minimum degree
• Proximity and Remoteness in Graphs: a survey
• Proximity and Radius in Outerplanar Graphs with Bounded Faces