University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301Bounds for the Co-PI index of a graph113892310.22052/ijmc.2015.8923ENE.KayaIgdir University
Science and Literature Faculty
Department of MathematicsA. D.MadenSelcuk University
Science Faculty
Department of MathematicsJournal Article20141010In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301Relationship between topological indices and thermodynamic properties and of the monocarboxylic acids applications in QSPR1528894410.22052/ijmc.2015.8944ENF.ShafieiDepartment of Chemistry, Science Faculty, Arak Branch, Islamic Azad University, Arak, IranJournal Article20141023Topological indices are the numerical value associated with chemical constitution purporting for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is a delightful playground for the exploration of proof techniques in Discrete Mathematics and its results have applications in many areas of sciences. One of the useful indices for examination of structure- property relationship is Randic' index. In this study is represented the relationship between the Randic', Balaban and Szeged indices and Harary numbers to the enthalpies of combustion ( liquid), enthalpies of vaporization( gas), enthalpies of formation ( liquid) and enthalpies of sublimation ( ) of monocarboxylic acids (C2- C20) are established, and then, some useful topological indices for examination of the structure- property relationship are presented.University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301On the distance based indices of H-phenylenic nanotorus2939904310.22052/ijmc.2015.9043ENA.HeydariDepartment of Science, Arak University of Technology, Arak, IranJournal Article20140624Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this graph by using the Wiener index. Finally we compute eccentric connectivity index of this graphUniversity of KashanIranian Journal of Mathematical Chemistry2228-64896120150301On the harmonic index and harmonic polynomial of Caterpillars with diameter four4149904410.22052/ijmc.2015.9044ENM.IranmaneshDepartment of Mathematics, Yazd University, 89195741, Yazd, IranM.SaheliDepartment of Mathematics, Yazd University, 89195741, Yazd, IranJournal Article20150316The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpillars withf diameter 4.University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301A new approach to compute acyclic chromatic index of certain chemical structures5161905610.22052/ijmc.2015.9056ENI.RajasinghSchool of Advanced Sciences, VIT University, Chennai-600127, IndiaR.RajanSchool of Advanced Sciences, VIT University, Chennai-600127, IndiaD.PaulSchool of Advanced Sciences, VIT University, Chennai-600127, IndiaJournal Article20150107An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerful tool to prove that this bound is sharp for certain chemical structures.University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301The matching interdiction problem in dendrimers6379906310.22052/ijmc.2015.9063ENG. H.ShirdelUniversity of Qom0000-0003-2759-4606N.KahkeshaniPh.D. Student at University of QomJournal Article20141111The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of dendrimers. Then, it is shown that proportion of difference of two optimal and approximate answers from the weight of maximum matching in these dendrimers is equal to the maximum value.University of KashanIranian Journal of Mathematical Chemistry2228-64896120150301Dynamical behavior and synchronization of chaotic chemical reactors model8192912910.22052/ijmc.2015.9129ENH.KheiriFaculty of Mathematical Sciences, University of Tabriz, Tabriz, IranB.NaderiPayame Noor universityJournal Article20141214In this paper, we discuss the dynamical properties of a chemical reactor model including Lyapunov exponents, bifurcation, stability of equilibrium and chaotic attractors as well as necessary conditions for this system to generate chaos. We study the synchronization of chemical reactors model via sliding mode control scheme. The stability of proposed method is proved by Barbalate’s lemma. Numerical Simulation is provided for illustration and verification of the proposed method.