Some new results on distance-based graph invariants (Q5902090): Difference between revisions

Several distance-based graph invariants are considered, such as the Wiener index (half the sum of all inter-vertex distances), the Szeged index (half the sum over all edges \(uv\) of the number of vertices closer to \(u\) than to \(v\) multiplied by the number of vertices closer to \( v\) than to \( u\)) and the related Schultz and Padmakar-Ivan indices, together with their extensions obtained by replacing one of both vertices by edges in the defining formulas. Several relations between these indices are proven for trees, for the edge graph of a graph and for products of graphs, leading to exact formulas for some indices for some new classes of graphs including Hamming graphs and \(C_4\)-nanotubes. Some extremal value bounds for Wiener and Szeged indices are obtained together with some asymptotic bounds, disproving a conjecture about the Szeged index.