Digraphs with large maximum Wiener index

Martin Knor, Riste Škrekovski and Aleksandra Tepeh

Applied Mathematics and Computation, 2016, vol. 284, issue C, 260-267

Abstract: Recently the concept of Wiener index was extended to digraphs which are not-necessarily strongly connected, and it was shown that some fundamental results extend naturally within this concept. This extension could be applicable in the topics of directed large networks, particularly because with this measure, one assigns finite values to the average distance and betweenness centrality of the nodes in a directed network. It is not hard to show that among digraphs on n vertices, the directed cycle C→n achieves the maximum Wiener index. Next, we investigate digraphs with the second maximum Wiener index. One can consider this problem in the realm of all digraphs or restricted to those obtained by directing undirected graphs, so called antisymmetric digraphs. In both situations, we obtain that such digraphs are constructed from C→n (n ≥ 6) by adding a single arc. We conclude the paper with consideration for possible further works.

Keywords: Wiener index; Directed graph; Average distance; Networks (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316301990
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:284:y:2016:i:c:p:260-267

DOI: 10.1016/j.amc.2016.03.007

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 ().