University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901Rhombellanic Crystals and Quasicrystals1671786366310.22052/ijmc.2018.126056.1353ENM. V.DiudeaBabes-Bolyai University, Cluj, RomaniaJournal Article20180401Design of some crystal and quasicrystal networks, based on rhombellane tiling,is presented. [1,1,1]Propellane,is a synthesized organic molecule; its hydrogenated form, the bicyclo[1.1.1]pentane,may be represented by the complete bipartite graph K2,3 which is the smallest rhombellane. Topology of translational and radial structures involving rhombellanes is described in terms of vertex symbol, connectivity sequence, ring sequence and map operations relating structures to their seeds. It is shown, by alternating sum of ranked substructures, that radial structures represent complex constructions of higher rank. Basic properties of rhombellanes, coloring included, are outlined.University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901One-Alpha Descriptor1791866512410.22052/ijmc.2018.118091.1342END.VukičevićUniversity fo SplitZ.Yarahmadiislamic azad universityJournal Article20180205Recently, one-two descriptor has been defined and it has been shown that it is a good predictor of the heat capacity at P constant (CP) and of the total surface area (TSA). In this paper, we analyze its generalizations by replacing the value 2 by arbitrary positive value . We show that these analyses may be on interest, because even good predictions of CP and TSA can be slightly improved. Furthermore, it can be expected that this more general descriptor can find a wider range of application than the original one. The extremal values of trees have been found for all values of .University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901A new family of high-order difference schemes for the solution of second order boundary value problems1871997050110.22052/ijmc.2018.94933.1306ENM.Bisheh-NiasarDepartment of Applied Mathematics, Faculty of Mathematical Science, University of Kashan, Kashan, IranA.SaadatmandiDepartment of Applied Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, IranM.Akrami-AraniDepartment of Applied Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, IranJournal Article20170809Many problems in chemistry, nanotechnology, biology, natural science, chemical physics and engineering are modeled by two point boundary value problems. In general, analytical solution of these problems does not exist. In this paper, we propose a new class of high-order accurate methods for solving special second order nonlinear two point boundary value problems. Local truncation errors of these methods are discussed. To illustrate the potential of the new methods, we apply them for solving some well-known problems, including Troesch’s problem, Bratu’s problem and certain singularly perturbed problem. Bratu’s problem and Troech’s problems, may be used to model some chemical reaction-diffusion and heat transfer processes. We also compare the results of this work with some existing results in the literature and show that the new methods are efficient and applicable.University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901On Reciprocal Complementary Wiener Index of a Graph2012127076810.22052/ijmc.2017.69915.1259ENH. S.RamaneKarnatak University, DharwadV. B.JoshiKarnatak University, DharwadV. V.ManjalapurKarnatak University, DharwadS. D.ShindheKarnatak University, DharwadJournal Article20161209The eccentricity of a vertex v of graph G is the largest distance between and any other vertex of a graph . The reciprocal complementary Wiener (RCW) index of is defined as,<br /> ,<br /> where D is the diameter of G and is the distance between the vertices and . In this paper we have obtained bounds for the index in terms of eccentricities and given an algorithm to compute the index.University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901The F–Index for some Special Graphs and some Properties of the F–Index2132257087510.22052/ijmc.2018.126298.1355ENA.YousefiDepartment of Mathematics, Science and Research Branch, Islamic Azad University,
P. O. Box 14515 – 1775, Tehran, IranA.IranmaneshTarbiat Modares UniversityA. A.DobryninSobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk 630090, RussiaA.TehranianIslamic Azad UniversityJournal Article20180406The "forgotten topological index" or "F–index" has been introduced by Furtula and Gutman in 2015. The F–index of a (molecular) graph is defined as the sum of cubes of the vertex degrees of the graph. In this paper, we compute this topological index for some special graphs such as Wheel graph, Barbell graph and Friendship graph. Moreover, the effects on the F–index are observed when some operations such as edge switching, edge moving and edge separating are applied to the graphs. Finally, we investigate degeneracy of F–index for small graphs.University of KashanIranian Journal of Mathematical Chemistry2228-64899320180901On the Bicyclic Graphs with Minimum Reduced Reciprocal Randic Index2272397359510.22052/ijmc.2018.141455.1378ENA.AliUniversity of Management & Technology Sialkot, Pakistan0000-0001-8160-4196S.ElumalaiVelammal Engineering College, Surapet, Chennai-66 Tamil Nadu, IndiaS.WangDepartment of Mathematics, Savannah State University Savannah, GA 31404, USAD.DimitrovHochschule fur Technik und Wirtschaft, Berlin, Germany
and
Faculty of Information Studies, Novo Mesto, SloveniaJournal Article20180720The reduced reciprocal Randić (RRR) index is a molecular structure descriptor (or more precisely, a topological index), which is useful for predicting the standard enthalpy of formation and normal boiling point of isomeric octanes. In this paper, a mathematical aspect of RRR index is explored, or more specifically, the graph(s) having minimum RRR index is/are identified from the collection of all n–vertex connected bicyclic graphs for n≥5. As a consequence, the best possible lower bound on the RRR index, for n–vertex connected bicyclic graphs is obtained when n≥5.