Some remarks on Wiener index of oriented graphs

Martin Knor, Riste Škrekovski and Aleksandra Tepeh

Applied Mathematics and Computation, 2016, vol. 273, issue C, 631-636

Abstract: In this paper, we study the Wiener index (i.e., the total distance or the transmission number) of not necessarily strongly connected digraphs. In order to do so, if there is no directed path from u to v, we follow the convention d(u,v)=0, which was independently introduced in several studies of directed networks. Under this assumption we naturally generalize the Wiener theorem, as well as a relation between the Wiener index and betweenness centrality to directed graphs. We formulate and study conjectures about orientations of undirected graphs which achieve the extremal values of Wiener index.

Keywords: Wiener index; Average graph distance; Total distance; Directed graph; Betweenness centrality; Social networks (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315013752
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:273:y:2016:i:c:p:631-636

DOI: 10.1016/j.amc.2015.10.033

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