Optimizing Wiener and Randić Indices of Graphs

A. C. Mahasinghe, K. K. W. H. Erandi and S. S. N. Perera

Advances in Operations Research, 2020, vol. 2020, 1-10

Abstract:

Wiener and Randić indices have long been studied in chemical graph theory as connection strength measures of graphs. Later, these indices were used in different fields such as network analysis. We consider two optimization problems related to these indices, with potential applications to network theory, in particular to epidemiological networks. Given a connected graph and a fixed total edge weight, we investigate how individual weights must be assigned to edges, minimizing the connection strength of the graph. In order to measure the connection strength, we use the weighted Wiener index and a modified version of the ordinary Randić index. Wiener index optimization is linear, while Randić index optimization turns out to be both nonlinear and nonconvex. Hence, we adopt the technique of separable programming to generate solutions. We present our experimental results by applying relevant algorithms to several graphs.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2020/3139867.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2020/3139867.xml (text/xml)

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:hin:jnlaor:3139867

DOI: 10.1155/2020/3139867

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().