University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 The First Geometric–Arithmetic Index of Some Nanostar Dendrimers 1 6 5541 10.22052/ijmc.2014.5541 EN A. Madanshekaf Semnan University M. Moradi Semnan University Journal Article 2013 03 25 Dendrimers are highly branched organic macromolecules with successive layers or generations of branch units surrounding a central core [1,4]. These are key molecules in nanotechnology and can be put to good use. In this article, we compute the first geometricarithmetic index of two infinite classes of dendrimers. Nanostar dendrimer The first geometric-arithmetic index https://ijmc.kashanu.ac.ir/article_5541_b9ad2e135053d1febb7d27424326357c.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 The Laplacian Polynomial and Kirchhoff Index of the k-th‎ Semi Total Point Graphs 7 15 6858 10.22052/ijmc.2014.6858 EN Z. Mehranian Department of Mathematics, University of Qom, Qom, Iran Journal Article 2014 06 04 The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎. Resistance distance‎ ‎Kirchhoff index‎ ‎Laplacian specturam‎ Derived graph‎ https://ijmc.kashanu.ac.ir/article_6858_49f40547a27c813e453cdcfff61b24ed.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 Flow Polynomial of some Dendrimers 17 20 7591 10.22052/ijmc.2014.7591 EN H. Sharifi Islamic Azad University G. H. Fath-Tabar University of Kashan Journal Article 2013 06 12 Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed. Flow polynomial Dendrimer Graph https://ijmc.kashanu.ac.ir/article_7591_08263a76931061fd7e4ced581cb66dad.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 The Neighbourhood Polynomial of some Nanostructures 21 25 7618 10.22052/ijmc.2014.7618 EN S. Alikhani Yazd University E. Mahmoudi Yazd University Journal Article 2014 09 06 The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some nanostructures. Neighbourhood Polynomial Dendrimer nanostar https://ijmc.kashanu.ac.ir/article_7618_915a872c50324158cd249be6c4db13ad.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 Perfect Matchings in Edge-Transitive Graphs 27 33 7772 10.22052/ijmc.2014.7772 EN A. Marandi University of Tehran A. H. Nejah University of Tehran A. Behmaram University of Tabriz Journal Article 2013 12 04 We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an end vertex in {u,v}. perfect matching Edge-transitive graph https://ijmc.kashanu.ac.ir/article_7772_6c1386b641e42586265ac97c82fcede7.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 The Center and Periphery of Composite Graphs 35 44 7773 10.22052/ijmc.2014.7773 EN Z. Yarahmadi Islamic Azad University S. Moradi Arak Unversity Journal Article 2014 01 04 The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nanotorus and nanotubes covered by C4. Eccentricity radius diameter Center periphery https://ijmc.kashanu.ac.ir/article_7773_e1bcc982b7f0fa5c7778485da3528061.pdf
University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 5 Supplement 1 2014 12 01 Relation Between Wiener, Szeged and Detour Indices 45 51 7776 10.22052/ijmc.2014.7776 EN N. Azimi Srtt Univ. 0000-0001-5623-9932 M. Roumena Srtt Univ. M. Ghorbani Department of mathematics, Shahid Rajaee Teacher Training University Journal Article 2014 02 14 In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number. Wiener index Szeged index Detour index https://ijmc.kashanu.ac.ir/article_7776_399fb4dba96bdfcaab0aa600fba7f2f6.pdf