Moments in graphs
From MaRDI portal
Publication:1946217
Abstract: Let be a connected graph with vertex set and a {em weight function} that assigns a nonnegative number to each of its vertices. Then, the {em -moment} of at vertex is defined to be , where stands for the distance function. Adding up all these numbers, we obtain the {em -moment of }: M_G^{
ho}=sum_{uin V}M_G^{
ho}(u)=1/2sum_{u,vin V}dist(u,v)[
ho(u)+
ho(v)]. This parameter generalizes, or it is closely related to, some well-known graph invariants, such as the {em Wiener index} , when for every , and the {em degree distance} , obtained when , the degree of vertex . In this paper we derive some exact formulas for computing the -moment of a graph obtained by a general operation called graft product, which can be seen as a generalization of the hierarchical product, in terms of the corresponding -moments of its factors. As a consequence, we provide a method for obtaining nonisomorphic graphs with the same -moment for every (and hence with equal mean distance, Wiener index, degree distance, etc.). In the case when the factors are trees and/or cycles, techniques from linear algebra allow us to give formulas for the degree distance of their product.
Recommendations
Cited in
(3)
This page was built for publication: Moments in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946217)