 Vertex-based and edge-based centroids of graphsYongxin Lan, Tao Li, Yuede Ma, Yongtang Shi and Hua Wang Applied Mathematics and Computation, 2018, vol. 331, issue C, 445-456 Abstract: The sum of distances between all pairs of vertices, better known as the Wiener index for its applications in Chemistry, has been extensively studied in the past decades. One of the most important properties related to distance between vertices, in the form of the middle part of a tree called the “centroid”, has been thoroughly analyzed. Also arised in the study of Chemical Graph Theory is the edge Wiener index which studies the distances between edges. Various problems on this concept have been proposed and investigated, along with its correlation to the original Wiener index. We extend the study to the middle part of a tree in this note, showing interesting and sometimes rather unexpected observations on the so-called “edge centroid”. We also shed some more light on the relations between these distance-based graph invariants by investigating the behaviors of different centroids and their differences. Such edge-centroids are also compared with the vertex-based analogues in both trees and graphs. This leads to challenging questions for future work in this direction. Keywords: Distance; Centroids; Wiener index (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:331:y:2018:i:c:p:445-456 DOI: 10.1016/j.amc.2018.03.045 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.