the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...

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 degreeof vertex u. in this paper we present some bounds of this new topological index.

Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...

The m-order connectivity index (G) m of a graph G is     1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d  G where 1 2 1 ... i i im d d d  runs over all paths of length m in G and i d denotes the degree of vertex i v . Also,        1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i ms d d d X G is its m-sum connectivity index. A dendrimer is an artificially manufactured or synth...

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...

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.

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze ext...