Let G be a simple graph,E(G)be the edge set of G,and,du,dv be the degree of vertex u,v,respectively.In this paper,we focuse on the definition of F-sum of graphs combined with four transformation operations S(G),R(G),Q(G),T(G)and Cartesian product of two graphs,and calculate the upper bound of the Sombor index of the four kinds of related graphs by using the maximum degree and classification,and characterize their extreme values.
NETL
NSTL
万方数据
