Chemistry the central of Science Combination physics ,biology and mathematics economics also . When Computer science hard core Mathematics added to it ,it is named as computational In fact , Quantum Physicist has created this field make relation strong between physical sciences Theoretical inorganic chemistry subfield where Mathematical methods are combined with fundamental laws study process c...

fatemeh karimi tabar was born in asadabad/hamedan (iran) in 1986. she completed her b.sc. in chemistry in 2008 from bu-ali sina university, hamedan, iran. she was graduated from m.sc. degree in organic chemistry from shiraz university 2010, shiraz, iran. she is currently organic chemistry ph.d student under the supervision of prof. m.a. zolfigol and prof. a. khazaei in department of chemistry a...

In the analysis of complex networks, the description of evolutionary processes, or investigations into dynamics on fitness or energy landscapes notions such as similarity, neighborhood, connectedness, or continuity of change appear in a natural way. These concepts are of an inherently topological nature. Nevertheless, the connection to the mathematical discipline of point set topology is rarely...

Mathematical modeling has proved to be a critically important approach in the study of many complex networks and dynamic systems in physics, engineering, chemistry, and biology. The nuclear factor κB (NF-κB) system consists of more than 50 proteins and protein complexes and is both a highly networked and dynamic system. To date, mathematical modeling has only addressed a small fraction of the m...

Chemical Graph Theory is a branch of Mathematical Chemistry whose focus interest to finding topological indices chemical graphs which correlate well with properties the molecules. In this study, we define edge version Sombor index, modified index and, Nirmala graph and compute exact formulas for certain families nanotubes nanotori.

the reverse degree distance of a connected graph $g$ is defined in discrete mathematical chemistry as [ r (g)=2(n-1)md-sum_{uin v(g)}d_g(u)d_g(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $g$, respectively, $d_g(u)$ is the degree of vertex $u$, $d_g(u)$ is the sum of distance between vertex $u$ and all other vertices of $g$, and $v(g)$ is the ...