The Schultz and the Modified Schultz Indices of Kragujevac Trees

 Let G be simple connected graph with the vertex and edge sets V (G) and E(G), respectively. The Schultz and the Modified Schultz indices of G are defined as Sc(G) = 1 2 ∑ u,v∈V (G) (du+dv)d(u, v), Sc∗ (G) = 1 2 ∑ u,v∈V (G) (du × dv)d(u, v), where d(u, v) is the topological distance between vertices u and v, dv is the degree of vertex v of G. In this paper, computation of the Schultz and the Modified Schultz indices of the Kragujevac trees is proposed. As an application, we obtain an upper bound and a lower bound for the Schultz and the modified Schultz indices of these trees.