University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901A Novel Molecular Descriptor Derived from Weighted Line Graph1952079337010.22052/ijmc.2017.84168.1287ENChandanaAdhikariSambalpur UniversityBijay KumarMishraSchool of Chemistry, Sambalpur University,
Jyoti Vihar - 768019Journal Article20170504The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the weighted line graph of the molecular structure and applied in correlating the physicochemical properties of alkane isomers with these descriptors. A weight is tagged at the vertex of the line graph, which consequently modifies the weight of the edge. These descriptors were found to classify the alkane isomers and served well in deriving the QSPR models for various physicochemical properties. The mathematical calculations include the quantitative treatment on the role of substituents (alkyl) in governing the properties under study of the alkane isomers. Further, the use of weighted line graph in the enumeration of the topological index opens up a new vista on application to heteroatomic systems.University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901Some Topological Indices of Edge Corona of Two Graphs2092229897010.22052/ijmc.2017.34313.1132ENChandrashekarAdigaUniversity of Mysore, IndiaMalpashreeRajuUniversity of Mysore, IndiaRakshithBIllava RamannaUniversity of Mysore, IndiaAnithaNarasimhamurthyPES University, IndiaJournal Article20150813In this paper, we compute the Wiener index, first Zagreb index, second<br /> Zagreb index, degree distance index and Gutman index of edge corona of<br /> two graphs. Also in some cases we derive formulas for Weiner index, Zagreb indices, degree distance and Gutman index in terms of vertices and edges .University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901The distinguishing number and the distinguishing index of graphs from primary subgraphs22324010167510.22052/ijmc.2019.152413.1400ENSaeidAlikhaniYazd University, Yazd, IranSamanehSoltaniDepartment of Mathematics, Yazd University, 89195-741, Yazd, IranJournal Article20181015The distinguishing number (index) <em>D</em>(<em>G</em>) (<em>D</em>'(<em>G</em>)) of a graph <em>G</em> is the least integer <em>d</em> such that <em>G</em> has an vertex labeling (edge labeling) with <em>d</em> labels that is preserved only by a trivial automorphism. Let <em>G</em> be a connected graph constructed from pairwise disjoint connected graphs <em>G</em><sub>1</sub>,... ,<em>G</em><sub>k</sub> by selecting a vertex of <em>G</em><sub>1</sub>, a vertex of <em>G</em><sub>2</sub>, and identifying these two vertices. Then continue in this manner inductively. We say that <em>G</em> is obtained by point-attaching from G<sub>1</sub>, ... ,G<sub>k</sub> and that G<sub>i</sub>'s are the primary subgraphs of <em>G</em>. In this paper, we consider some particular cases of these graphs that are of importance in chemistry and study their distinguishing number and distinguishing index.University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901The Minimum Estrada Index of Spiro Compounds with k Quadrangles24124910189210.22052/ijmc.2019.149094.1392ENMohammad AliIranmaneshYazd UniversityRaziehNejatiYazd UniversityJournal Article20180917Abstract. Let G = (<em>V</em>,<em>E</em>) be a finite and simple graph with λ<sub>1</sub>, λ<sub>2</sub>,...,λ<sub>n</sub> as its eigenvalues.The Estrada index of <em>G</em> is EE(G) =∑<em><sup>n</sup></em><sub><em>i</em>=1</sub><em>e</em>^{λ<sub>i</sub>} . A spiro compound is a chemical compound that presents a twisted structure of two or more rings, in which 2 or 3 rings are linked together by one common atom. In this paper, we show that the symmetric and stable spiro compounds among all spiro compounds have the minimum Estrada index.University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901An upwind local radial basis functions-finite difference (RBF-FD) method for solving compressible Euler equation with application in finite-rate Chemistry25126710201610.22052/ijmc.2017.106402.1325ENMostafaAbbaszadehAmirkabir University of Technology, Tehran, Iran, Faculty of Mathematics and ComputerMehdiDehghanDepartment of Applied Mathematics, Faculty of Mathematics and Computer Sciences,
Amirkabir University of Technology,GholamrezaKaramaliFaculty of Basic Sciences, Shahid Sattari Aeronautical University of Sience and Technology,
South MehrabadJournal Article20171121The main aim of the current paper is to propose an upwind local radial basis functions-finite<br /> difference (RBF-FD) method for solving compressible Euler equation. The mathematical formulation of chemically reacting, inviscid, unsteady flows with species conservation equations<br /> and finite-rate chemistry is studied. The presented technique is based on the developed idea in<br /> [58]. For checking the ability of the new procedure, the compressible Euler equation is solved.<br /> This equation has been classified in category of system of advection-diffusion equations. The<br /> solutions of advection equations have some shock, thus, special numerical methods should be<br /> applied for example discontinuous Galerkin and finite volume methods. Moreover, two problems are given that show the acceptable accuracy and efficiency of the proposed scheme.University of KashanIranian Journal of Mathematical Chemistry2228-648910320190901Topological Efficiency of Some Product Graphs26927810201710.22052/ijmc.2017.82177.1280ENKannanPattabiramanAnnamalai UniversityTholkappianSuganyaAnnamalai UniversityJournal Article20170415The topological efficiency index of a connected graph $G,$ denoted by $rho (G),$ is defined as $rho(G)=frac{2W(G)}{left|V(G)right|underline w(G)},$ where $underline w(G)=text { min }left{w_v(G):vin V(G)right}$ and $W(G)$ is the Wiener index of $G.$ In this paper, we obtain the value of topological efficiency index for some composite graphs such as tensor product, strong product, symmetric difference and disjunction of two connected graphs. Further, we have obtained the topological efficiency index for a double graph of a given graph.