On the additively weighted Harary index of some composite graphs
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.
- Additively weighted Harary index of some composite graphs
- Multiplicatively weighted Harary index of graphs
- On Harary index of graphs
- Series expansion of the directed percolation probability
- The Harary index of a graph
- The Zagreb coindices of graph operations
- Vertex-weighted Wiener polynomials for composite graphs
- Weighted Harary indices of apex trees and \(k\)-apex trees
- Additively weighted Harary index of some composite graphs
- Multiplicatively weighted Harary index of some graph operations
- On the multiplicatively weighted Harary index of composite graphs
- scientific article; zbMATH DE number 7533262 (Why is no real title available?)
- On ordinary and weighted Harary indices of Mycielski graphs
- On the semigroup whose elements are subgraphs of a complete graph
This page was built for publication: On the additively weighted Harary index of some composite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358243)
