The first general Zagreb index is defined as $M_1^lambda(G)=sum_{vin V(G)}d_{G}(v)^lambda$. The case $lambda=3$, is called F-index. Similarly, reformulated first general Zagreb index is defined in terms of edge-drees as $EM_1^lambda(G)=sum_{ein E(G)}d_{G}(e)^lambda$ and the reformulated F-index is $RF(G)=sum_{ein E(G)}d_{G}(e)^3$. In this paper, we compute the reformulated F-index for some grap...

the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v  , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g  u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twogr...

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

Let $G*H$ be the product $*$ of $G$ and $H$. In this paper we determine the rth power of the graph $G*H$ in terms of $G^r, H^r$ and $G^r*H^r$, when $*$ is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation $(G*H)^r=G^r*H^r$. We also compute the Wiener index and Wiener polarity index of the skew product.

let g be a simple connected graph. the first and second zagreb indices have been introducedas  vv(g)(v)2 m1(g) degg and m2(g)  uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g)     (degg(u)  degg inthis paper, the hyperzagreb index of the cartesian product...

in this paper, the weighted szeged indices of cartesian product and corona product of twoconnected graphs are obtained. using the results obtained here, the weighted szeged indices ofthe hypercube of dimension n, hamming graph, c4 nanotubes, nanotorus, grid, t− fold bristled,sunlet, fan, wheel, bottleneck graphs and some classes of bridge graphs are computed.

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

in this paper, the hyper - zagreb index of the cartesian product, composition and corona product of graphs are computed. these corrects some errors in g. h. shirdel et al.[11].

distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.