University of KashanIranian Journal of Mathematical Chemistry2228-648911320200901Turbulence, Erratic Property and Horseshoes in a Coupled Lattice System related with Belusov−Zhabotinsky Reaction13314011081010.22052/ijmc.2020.160449.1413ENYu ZhaoSchool of Mathematic and Computer Science, Guangdong Ocean University
Zhanjiang, Guangdong, P. R. ChinaRisong LiSchool of Mathematic and Computer Science, Guangdong Ocean University Zhanjiang, Guangdong, P. R. ChinaJournal Article20181209In this paper we continue to study the chaotic properties of the following lattice dynamical system: b<sub>j</sub><sup>i+1</sup>= a<sub>1 </sub>g(b<sub>j</sub><sup>i</sup>)+ a<sub>2 </sub>g(b<sub>j-1</sub><sup>i</sup>)+ a<sub>3 </sub>g(b<sub>j+1</sub><sup>i</sup>), where i is discrete time index, j is lattice side index with system size L, g is a selfmap on [0, 1] and a<sub>1</sub>+a<sub>2</sub>+a<sub>3 </sub>∊ [0, 1] with a<sub>1</sub>+a<sub>2</sub>+a<sub>3</sub>=1 are coupling constants. In particular, it is shown that if g is turbulent (resp. erratic) then so is the above system, and that if there exists a g-connected family G with respect to disjointed compact subsets D<sub>1</sub>, D<sub>2</sub>, …, D<sub>m</sub>, then there is a compact invariant set K'⊆D' such that F |<sub>K'</sub> is semi-conjugate to m-shift for any coupling constants a<sub>1</sub>+a<sub>2</sub>+a<sub>3 </sub>∊ [0, 1] with a<sub>1</sub>+a<sub>2</sub>+a<sub>3</sub>=1, where D' ⊆ I<sup>L</sup> is nonempty and compact. Moreover, an example and two problems are given.https://ijmc.kashanu.ac.ir/article_110810_ef4de719dcba034b6498afbc94e028ce.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-648911320200901Bounds of the Symmetric Division Deg Index for Trees and Unicyclic Graphs with a Perfect Matching14115911081110.22052/ijmc.2020.214829.1481ENAbhay RajpootDepartment of Mathematical Sciences, IIT (BHU) Varanasi0000-0003-3301-8285Lavanya SelvaganeshDepartment of Mathematical Sciences, IIT (BHU) Varanasi0000-0002-8208-5372Journal Article20200121The Symmetric division deg (SDD) index is a well-established valuable index in the analysis of quantitative structure-property and structure-activity relationships for molecular graphs. In this paper, we study the range of SDD-index for special classes of trees and unicyclic graphs. We present the ﬁrst four lower bounds for SDD-index of trees and unicyclic graphs, which admit a perfect matching and ﬁnd the subclasses of graphs that attain these bounds. Further, we also compute the upper bounds of SDD-index for the collection of molecular graphs, namely the trees and unicyclic graphs, each having maximum degree four and that admit a perfect matching.https://ijmc.kashanu.ac.ir/article_110811_86787a45520dab7b826ebcadc653c49a.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-648911320200901Non-uniform Hypergraphs16117711081410.22052/ijmc.2020.222023.1490ENGholam Hassan ShirdelUniversity of Qom0000-0003-2759-4606Ameneh MortezaeeDepartment of Mathematics and Computer Science, University of Qom, Qom, IRAN.Effat Golpar-rabokyDepartment of Mathematics and Computer Science, University of Qom, Qom, IRAN.Journal Article20200302The non-uniform hypergraph is the general hypergraph in which an edge can join any number of vertices. This makes them more applicable data structure than the uniform hypergraph and also, on the other hand, mathematical relations of the nonuniform hypergraph are usually complicated. In this paper, we study the non-uniform hypergraph more precisely and then analyze some of its spectral properties and compare them with those of the uniform hypergraph.https://ijmc.kashanu.ac.ir/article_110814_7456396fd9744b91c3877caf6b89d359.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-648911320200901Prediction of IC50 Values of 2−benzyloxybenzamide Derivatives using Multiple Linear Regression and Artificial Neural Network Methods17919911082510.22052/ijmc.2020.217837.1483ENFariba Masoomi SefiddashtiDepartment of Chemistry, Faculty of Sciences, Shahrekord University, P. O. Box 115, Shahrekord, IranHedayat HaddadiDepartment of Chemistry, Faculty of Sciences, Shahrekord University, P. O. Box 115, Shahrekord, Iran0000-0003-2303-6711Saeid AsadpourDepartment of Chemistry, Faculty of Sciences, Shahrekord University, P. O. Box 115, Shahrekord, Iran0000-0003-3049-5799Shima Ghanavati NasabDepartment of Chemistry, Faculty of Sciences, Shahrekord University, P. O. Box 115, Shahrekord, Iran0000-0001-7350-5569Journal Article20200209In this study, six molecular descriptors were selected from a pool of variables using stepwise regression to built a QSAR model for a series of 2-benzyloxy benzamide derivatives as an SMS2 inhibitor to reduce atherosclerosis. Simple multiple linear regression (MLR) and a nonlinear method, artificial neural network (ANN), were used to modeling the bioactivities of the compounds. Modeling was carried out in total with 34 compounds of 2-benzyl oxybenzamide derivatives. PCA was used to divide the compounds into two groups of two training series and tests. The model was constructed with 27 combinations as training set, then the validity and predictive ability of the model were evaluated with the remaining 7 combinations. While the MLR provides an acceptable model for predictions, the ANN-based model significantly improves the predictive ability. In ANN model the average relative error (RE%) of prediction set is lower than 1% and square correlation coefficient (R2) is 0.9912.https://ijmc.kashanu.ac.ir/article_110825_9ad7181fa7989d251569b505e68a3361.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-648911320200901Extremal polygonal cacti for Wiener index and Kirchhoff index20121111082610.22052/ijmc.2020.225271.1497ENMingyao ZengHunan Normal UniversityQiqi XiaoHunan Normal UniversityZikai TangHunan Normal UniversityHanyuan DengHunan Normal University0000-0003-1680-2473Journal Article20200402For a connected graph G, the Wiener index W(G) of G is the sum of the distances of all pairs of vertices, the Kirchhoff index Kf(G) of G is the sum of the resistance distances of all pairs of vertices. A k-polygonal cactus is a connected graph in which the length of every cycle is k and any two cycles have at most one common vertex. In this paper, we give the maximum and minimum values of the Wiener index and the Kirchhoff index for all k-polygonal cacti with n cycles and determine the corresponding extremal graphs, generalize results of spiro hexagonal chains with n hexagons.https://ijmc.kashanu.ac.ir/article_110826_2ae4da0c6956fe01eeb564966aaa42c3.pdf