100 research outputs found
A successful concept for measuring non-planarity of graphs: the crossing number
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a limited group of specialists, emerges as a significant graph parameter. This paper has dual purposes: first, it reviews foundational, historical, and philosophical issues of crossing numbers, second, it shows a new lower bound for crossing numbers. This new lower bound may be helpful in estimating crossing numbers
Wiener Index and Remoteness in Triangulations and Quadrangulations
Let be a a connected graph. The Wiener index of a connected graph is the
sum of the distances between all unordered pairs of vertices. We provide
asymptotic formulae for the maximum Wiener index of simple triangulations and
quadrangulations with given connectivity, as the order increases, and make
conjectures for the extremal triangulations and quadrangulations based on
computational evidence. If denotes the arithmetic mean
of the distances from to all other vertices of , then the remoteness of
is defined as the largest value of over all vertices
of . We give sharp upper bounds on the remoteness of simple
triangulations and quadrangulations of given order and connectivity
- …