Minimum of Product of Wiener and Harary Indices
Enkhbayar Azjargal, Batmend Horoldagva, İvan Gutman
Abstract
Open-access reader
Enkhbayar Azjargal, Batmend Horoldagva, İvan Gutman
Abstract
Open-access reader
For a connected graph G, the Wiener index W and the Harary index H are defined as W = u,v d(u, v) and H = u,v 1/d(u, v), respectively.Recently, in MATCH 91 (2024) 287, the extremal value of the product W • H was studied and shown that W • H ≥ n 2 , with equality for the complete graph.We now extend this result to all graphs of order n and size m, and characterize the respective species with minimum W •H-value.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For a connected graph G, the Wiener index W and the Harary index H are defined as W = u,v d(u, v) and H = u,v 1/d(u, v), respectively.Recently, in MATCH 91 (2024) 287, the extremal value of the product W • H was studied and shown that W • H ≥ n 2 , with equality for the complete graph.We now extend this result to all graphs of order n and size m, and characterize the respective species with minimum W •H-value.
Key concepts: Wiener index, Combinatorics, Mathematics, Graph, Product (mathematics), Index (typography), Order (exchange), Connectivity