University of KashanIranian Journal of Mathematical Chemistry2228-64899120180301Hypercube Related Polytopes185428310.22052/ijmc.2017.101019.1318ENM. V.DiudeaBabes-Bolyai University, Cluj, RomaniaJournal Article20171014Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.https://ijmc.kashanu.ac.ir/article_54283_c8f8c9ffcbc23f8dfa542dbfc2a3a8d4.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301General Theory of Cycle-Dependence of Total pi-Electron Energy9165450310.22052/ijmc.2017.83263.1285ENI. GutmanFaculty of Science, University of Kragujevac, Kragujevac, Serbia0000-0001-9681-1550Journal Article20170426The theoretical treatment of cycle-effects on total pi-electron energy,<br /><br /> mainly elaborated by Nenad Trinajstic and his research group, is<br /><br /> re-stated in a general and more formal manner. It enables to envisage several<br /><br /> other possible ways of measuring the cycle-effects and points at further<br /><br /> directions of research.https://ijmc.kashanu.ac.ir/article_54503_13f8767d02456a19a5b7a8c6affb8c32.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301More Inequalities for Laplacian Indices by Way of Majorization17245488010.22052/ijmc.2017.100951.1317ENJ. PalaciosThe University of New Mexico, Albuquerque, NM 87131, USAJournal Article20171014The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG = 2|E|/n. We also find some particular tight bounds for some classes of graphs in terms of customary graph parameters.https://ijmc.kashanu.ac.ir/article_54880_d880ee06482840ddf89dd87e9a57f1b2.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301Fractal-Like Kinetics Study of Adsorption on Multi-walled Carbon Nanotube25355488110.22052/ijmc.2017.48936.1175ENH. BashiriUniversity of KashanA. SahjariUniversity of KashanJournal Article20160221The fractal degree of adsorption on the multi-walled carbon nanotube has been investigated. The fractal-like Langmuir kinetics model has been used to obtain the fractal degree of ion adsorption on multi-walled carbon nanotube. The behavior of the fractal-like kinetics equation was compared with some famous rate equations like Langmuir, pseudo-first-order and pseudo-second-order equations. It is shown that the kinetic of adsorption onto multi-walled carbon nanotube can be used to obtain its spectral dimension, successfully.https://ijmc.kashanu.ac.ir/article_54881_f0448acb456b2617e794659a8e401a55.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301On Common Neighborhood Graphs II37465531310.22052/ijmc.2017.53463.1195ENA. HamzehTarbiat Modares UniversityA. IranmaneshTarbiat Modares University0000-0003-2639-9454S. Hossein-ZadehTarbiat Modares UniversityM. A.HosseinzadehTarbiat Modares UniversityI. GutmanUniversity of Kragujevac0000-0001-9681-1550Journal Article20160503Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.https://ijmc.kashanu.ac.ir/article_55313_8c66633a3d6bc9e712ed2dae39f03636.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301On the Eccentric Connectivity Index of Unicyclic Graphs47565533210.22052/ijmc.2017.59425.1231ENY. NacaroğluDepartment of Mathematics, Faculty of Science, Selcuk UniversityA. D.MadenDepartment of Mathematics, Faculty of Science, Selcuk UniversityJournal Article20160813In this paper, we obtain the upper and lower bounds on the eccen-<br /> tricity connectivity index of unicyclic graphs with perfect matchings. Also we<br /> give some lower bounds on the eccentric connectivity index of unicyclic graphs<br /> with given matching numbers.https://ijmc.kashanu.ac.ir/article_55332_90df2cb067f37b466f182b9336756750.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301A Note on Revised Szeged Index of Graph Operations57635533310.22052/ijmc.2017.58647.1228ENN. DehgardiSirjan University of Technology0000-0001-8214-6000Journal Article20160730Let $G$ be a finite and simple graph with edge set $E(G)$. The revised Szeged index is defined as<br /> $Sz^{*}(G)=\sum_{e=uv\in E(G)}(n_u(e|G)+\frac{n_{G}(e)}{2})(n_v(e|G)+\frac{n_{G}(e)}{2}),$<br /> where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and <br /> $n_{G}(e)$ is the number of<br /> equidistant vertices of $e$ in $G$. <br /> In this paper, we compute the revised Szeged index of the<br /> join and corona product of graphs.https://ijmc.kashanu.ac.ir/article_55333_c6c9bd64629c680d2b0b41431ef49496.pdfUniversity of KashanIranian Journal of Mathematical Chemistry2228-64899120180301Weak Chemical Hyperstructures Associated to Electrochemical Cells65755579510.22052/ijmc.2017.88790.1294ENM. Al TahanLebanese International UniversityB. DavvazYazd UniversityJournal Article20170608Algebraic hyperstructures have many applications in various sciences. The main purpose of this paper is to provide a new application of weak hyperstructures in Chemistry. More precisely, we present three different examples of hyperstructures associated to electrochemical cells. In which we prove that our hyperstructures are Hv-semigroups and we present some interesting results.https://ijmc.kashanu.ac.ir/article_55795_08e59993d03ec6a0c0b968c95364f2a3.pdf