in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

in this paper, some applications of our earlier results in working with chemical graphs arepresented.

the do1(18c6)fi (mwli. na. k and i 8c6=18-crown-6) complexes have been chosen as the model systems toinvestigate the nature of chemical bonds between alkali metal cations and large mffitidentaie orgmnic ligands.the b3lyp/6-3i+g(d,p) level of calculation has been used for obtaining equilibrium geernetnes and p(r)functions (electron density distributions). by the aid of fundamental physical theor...

the zagreb indices are the oldest graph invariants used in mathematical chemistry to predictthe chemical phenomena. in this paper we define the multiple versions of zagreb indicesbased on degrees of vertices in a given graph and then we compute the first and secondextremal graphs for them.

In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.

the first geometric-arithmetic index was introduced in the chemical theory as the summationof 2 du dv /(du  dv ) overall edges of the graph, where du stand for the degree of the vertexu. in this paper we give the expressions for computing the first geometric-arithmetic index ofhexagonal systems and phenylenes and present new method for describing hexagonal systemby corresponding a simple graph...

The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given graph and then we compute the first and second extremal graphs for them.

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.