In this paper, we show that in the class of connected graphs G of order n ≥ 3 having girth at least equal to k, 3 ≤ k ≤ n, the unique graph G having minimum general sum-connectivity index χα(G) consists of Ck and n−k pendant vertices adjacent to a unique vertex of Ck, if−1 ≤ α < 0. This property does not hold for zeroth-order general Randić index Rα(G).

Let $G$ be a connected graph. The Wiener index of graph is the sum distances between all unordered pairs vertices. We provide asymptotic formulae for maximum simple triangulations and quadrangulations with given connectivity, as order increases, make conjectures extremal based on computational evidence. If $\overline{\sigma}(v)$ denotes arithmetic mean from $v$ to other vertices $G$, then remot...

The Randić index R(G) of a nontrivial connected graph G is defined as the sum of the weights (d(u)d(v))− 1 2 over all edges e = uv ofG. We prove that R(G) ≥ d(G)/2, where d(G) is the diameter of G. This immediately implies that R(G) ≥ r(G)/2, which is the closest result to the well-known Grafiti conjecture R(G) ≥ r(G) − 1 of Fajtlowicz [4], where r(G) is the radius of G. Asymptotically, our res...

Let G be a nonempty simple graph with vertex set V(G) and an edge E(G). For every injective labeling f:V(G)?Z, there are two induced labelings, namely f+:E(G)?Z defined by f+(uv)=f(u)+f(v), f?:E(G)?Z f?(uv)=|f(u)?f(v)|. The sum index the difference minimum cardinalities of ranges f+ f?, respectively. We provide upper lower bounds on index, determine various families graphs. also interesting con...

Let G(n; m) be a connected graph without loops and multiple edges which has n vertices and m edges. We ÿnd the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n; m) raised to the power − 1 2 , attains maximum.

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

The atom bond connectivity index of a graph is a new topological index was defined by E. Estrada as ABC(G)  uvE (dG(u) dG(v) 2) / dG(u)dG(v) , where G d ( u ) denotes degree of vertex u. In this paper we present some bounds of this new topological index.