Wiener Index and Remoteness in Triangulations and Quadrangulations
Let $G$ 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 ma...
Main Authors: | Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2021-03-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6473/pdf |
Similar Items
-
Wiener index in graphs with given minimum degree and maximum degree
by: Peter Dankelmann, et al.
Published: (2021-06-01) -
Proximity, remoteness and maximum degree in graphs
by: Peter Dankelmann, et al.
Published: (2022-11-01) -
Determining triangulations and quadrangulations by boundary distances
by: Haslegrave, J
Published: (2023) -
The quotients between the (revised) Szeged index and Wiener index of graphs
by: Huihui Zhang, et al.
Published: (2017-05-01) -
Random irreducible quadrangulations
by: Bergant, S
Published: (2019)