Damghan University PressGlobal Analysis and Discrete Mathematics2476-53416120210801The Schultz and the Modified Schultz Indices of Kragujevac Trees9910820810.22128/gadm.2021.408.1045ENAbbasHeydariArak Uinversity of Technology, Arak, Iran.Journal Article20210428Let <em>G</em> be simple connected graph with the vertex and edge sets <em>V(G)</em> and <em>E(G)</em>, respectively. The Schultz and Modified Schultz indices of a connected graph <em>G</em> are defined as<em> Sc(G) </em>=1/2 ∑<em><sub>u,v∈V(G)</sub> (d<sub>u</sub> + d<sub>v</sub>)d(u,v)</em> and <em>Sc*(G)</em> = 1\2∑<em><sub>u,v</sub></em><sub>∈ V</sub><em>(d<sub>u</sub>×d<sub>v</sub>)d(u, v)</em>, where<em> d(u, v)</em> is the topological distance between vertices u and v, d<sub>v</sub> is the degree of vertex v of <em>G</em>. In this paper, computation of the Schultz and Modified Schultz indices of the Kragujevac trees is proposed. As application, we obtain an upper bound and a lower bound for the Schultz and the modified Schultz indices of this tree.https://gadm.du.ac.ir/article_208_8b96e66b3e98da5c42f3b3eb39c07ff1.pdf