Trees with the maximal value of Graovac–Pisanski index

Martin Knor, Riste Škrekovski and Aleksandra Tepeh

Applied Mathematics and Computation, 2019, vol. 358, issue C, 287-292

Abstract: Let G be a graph. The Graovac–Pisanski index is defined as GP(G)=|V(G)|2|Aut(G)|∑u∈V(G)∑α∈Aut(G)dG(u,α(u)), where Aut(G) is the group of automorphisms of G. This index is considered to be an extension of the original Wiener index, since it takes into account not only the distances, but also the symmetries of the graph. In this paper, for each n we find all trees on n vertices with the maximal value of Graovac–Pisanski index. With the exception of several small values of n, there are exactly two extremal trees, one of them being the path.

Keywords: Topological indices; Graovac-Pisanski index; Trees (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319303224
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:358:y:2019:i:c:p:287-292

DOI: 10.1016/j.amc.2019.04.034

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().