for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...

darafsheh and assari in [normal edge-transitive cayley graphs onnon-abelian groups of order 4p, where p is a prime number, sci. china math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order$4p$. in this paper we continue this work by classifying theconnected cayley graph of groups of order $2pq$, $p > q...

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...

‎darafsheh and assari in [normal edge-transitive cayley graphs on non-abelian groups of order 4p‎, ‎where $p$ is a prime number‎, ‎sci‎. ‎china math‎., ‎56 (1) (2013) 213-219.] classified the connected normal edge transitive and‎ ‎$frac{1}{2}-$arc-transitive cayley graph of groups of order $4p$‎. ‎in this paper we continue this work by classifying the‎ ‎connected cayley graph of groups of order...

let $g$ be a finite simple graph whose vertices and edges are weighted by two functions. in this paper we shall define and calculate entropy of a dynamical system on weights of the graph $g$, by using the weights of vertices and edges of $g$. we examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. at the end it is shown that, for $rin [0,+infty]$, t...

In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...

Graph conditions are a means to express structural properties for graph transformation systems and graph programs in a large variety of application areas. With HR∗ graph conditions, non-local graph properties like “there exists a path of arbitrary length” or “the graph is circle-free” can be expressed. We show, by induction over the structure of formulas and conditions, that (1) any node-counti...

Techniques for the verification of structural invariants in graph transformation systems typically rely on the derivation of negative application conditions that are attached to graph transformation rules in order to avoid the runtime occurrence of forbidden structural patterns in the system model. In this paper, we propose a practical approach for this derivation process, which produces the re...