On the additively weighted Harary index of some composite graphs (Q2358243)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the additively weighted Harary index of some composite graphs |
scientific article; zbMATH DE number 6734344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the additively weighted Harary index of some composite graphs |
scientific article; zbMATH DE number 6734344 |
Statements
On the additively weighted Harary index of some composite graphs (English)
0 references
22 June 2017
0 references
Summary: The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. The additively weighted Harary index \(H_A(G)\) is a modification of the Harary index in which the contributions of vertex pairs are weighted by the sum of their degrees. This new invariant was introduced by \textit{Y. Alizadeh} et al. [Discrete Math. 313, No. 1, 26--34 (2013; Zbl 1254.05191)] and they posed the following question: What is the behavior of \(H_A(G)\) when \(G\) is a composite graph resulting for example by splice, link, corona and rooted product? We investigate the additively weighted Harary index for these standard graph products. Then we obtain lower and upper bounds for some of them.
0 references
additively weighted Harary index
0 references
composite graph
0 references
corona
0 references
rooted product
0 references
splice
0 references
link
0 references
0.935343623161316
0 references
0.9317806363105774
0 references
0.8811856508255005
0 references
0.8742307424545288
0 references
0.8332980275154114
0 references