The sharp bounds on general sum-connectivity index of graphs for operations based on strong product
For a graph G,the edge set of graph G denoted by E(G),the vertex set of graph G denoted by V(G),let dG(v)denote the degree of v.For an edge e=uv,the general sum-connectivity index xα(e)=(dG(u)+dG(v))α,in which α is any real number.In current paper,we introduce firstly the four operations(S,R,Q,T)of the graph,then give the strong product under the four operations,and determine the upper and lower bounds of the general sum-connectivity index of the four graphs by using the maximum and minimum degrees.
general sum-connectivity indexstrong productfour new operationsF-sum
万方数据
维普
