University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Hyperdiamonds: a Topological View729516210.22052/ijmc.2011.5162ENM. V.DIUDEA“Babes-Bolyai” University, RomaniaA. ILIĆUniversity of Niš,
SerbiaM. MEDELEANUUniversity “Politehnica”
Timisoara, RomaniaJournal Article20140422Hyperdiamonds are covalently bonded fullerenes in crystalline forms, more or less related to diamond, and having a significant amount of sp3 carbon atoms. Design of several hypothetical crystal networks was performed by using our original software programs CVNET and NANO-STUDIO. The topology of the networks is described in terms of the net parameters and several counting polynomials, calculated by NANO-STUDIO, OMEGA and PI software programs.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Evaluation of the Mineral Contents in Fish Meal by FT- NIR using PLS and Kernel PLS3138516310.22052/ijmc.2011.5163ENS. MASOUMUniversity of Kashan,
I. R. IRANA. ALISHAHIDepartment of Fisheries and Environmental Science, Tehran University, Karaj, IRANM. SHEKARCHITehran University, IRANH. FARAHMANDSanitary Ministry of Iran, IRANJournal Article20140422In the present work we study the use of Fourier transform near infrared spectroscopy (FTNIRS) technique to analysis the calcium (Ca), phosphorus (P) and copper (Cu) contents of fish meal. The regression methods employed were partial least squares (PLS) and kernel partial least squares (KPLS). The results showed that the efficiency of KPLS was better than PLS. As a whole, the application of FT-NIRS with PLS and KPLS was as a suitable option for replacing the routine chemical analysis to assess the mineral content in fish meal, allowing immediate control of the fish meal without prior sample treatment or destruction.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Eccentric and Total Eccentric Connectivity Indices of Caterpillars3944516410.22052/ijmc.2011.5164ENKH. FATHALIKHANIUniversity of Tehran, Tehran, IranH. YOUSEFI-AZARIUniversity of Tehran, IranJournal Article20140422Consider a simple connected graph with the vertex set . The eccentric and total connectivity indices of are defined as Σ and Σ , respectively. Here, denotes the degree of a vertex and is its eccentricity. In this paper, these two indices are calculated for a given arbitrary caterpillar.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Energy and Wiener Index of Zero-Divisor Graphs4551516610.22052/ijmc.2011.5166ENM. R.AHMADIUniversity
of Kashan, I. R. IranR. JAHANI-NEZHADUniversity
of Kashan, I. R. IranJournal Article20140422Let R be a commutative ring and (R) be its zerodivisor graph. In this article, we study Wiener index and energy of Γ(Zn ) where n = pq or n = p2q and p, q are primes. A MATLAB code for our calculations is also presented.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401The Clar Number of Fullerene C24n and Carbon Nanocone CNC4[n]5359516810.22052/ijmc.2011.5168ENM. GHORBANIShahid Rajaee Teacher Training
University, I. R. IranE. NASERPOURShahid Rajaee Teacher Training
University, I. R. IranJournal Article20140422A fullerene graph is a 3−connected planar graph whose faces are pentagons and hexagons. The Clar number of a fullerene is the maximum size of sextet patterns, the sets of disjoint hexagons which are all M-alternating for a Kekulé structure M of F. An exact formula of Clar number of some fullerene graphs and a class of carbon nanocones are obtained in this paper.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401The Eccentric Connectivity Index of Some Special Graphs6165516910.22052/ijmc.2011.5169ENM. A.IRANMANESHYazd University, IranR. HAFEZIEHYazd University, IranJournal Article20140422If is a connected graph with vertex set , then the eccentric connectivity index of , , is defined as Σ deg where deg is the degree of a vertex and is its eccentricity. Let A, B and C are families of graphs made by joining to , made by putting instead of each vertex in and made by putting instead of each vertex in , respectively. In this paper we compute the eccentric connectivity index of these families of graphs.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Further Results on Wiener Polarity Index of Graphs6770517010.22052/ijmc.2011.5170ENA. BEHMARAMUniversity of Tehran,
I. R. IranH. YOUSEFI-AZARIInstitute for Research in Fundamental Sciences (IPM), I. R. IranJournal Article20140422The Wiener polarity index Wp(G) of a molecular graph G of order n is the number of unordered pairs of vertices u, v of G such that the distance d(u,v) between u and v is 3. In an earlier paper, some extremal properties of this graph invariant in the class of catacondensed hexagonal systems and fullerene graphs were investigated. In this paper, some new bounds for this graph invariant are presented. A relationship between Wiener and Wiener polarity index of some classes of graphs are also presented.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Hosoya Polynomial of an Infinite Family of Dendrimer Nanostar7179517110.22052/ijmc.2011.5171ENCH. ESLAHCHIShahid Beheshti University, IranS. ALIKHANIYazd University, IranM. H.AKHBARIIslamic Azad University, Estahban Branch, Estahban, IranJournal Article20140422Let G be a simple graph. The Hosoya polynomial of G is ( , ) , ( , ) = { , } ( ) xd u v H G x u v V G where d(u,v) denotes the distance between vertices u and v . The dendrimer nanostar is a part of a new group of macromolecules. In this paper we compute the Hosoya polynomial for an infinite family of dendrimer nanostar. As a consequence we obtain the Wiener index and the hyper-Wiener index of this dendrimer.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401On the Spectra of Reduced Distance Matrix of Thorn Graphs8187517210.22052/ijmc.2011.5172ENA. HEYDARIArak Branch, Islamic Azad University, Arak, IranJournal Article20140422Let G be a simple connected graph and {v1, v2, …, vk} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)– entry is the topological distance between vi and vj of G. In this paper, we obtain the spectrum of the reduced distance matrix of thorn graph of G, a graph which obtained by attaching some new vertices to pendent vertices of G. As an application we compute the spectrum of reduced distance matrix for some dendrimer graphs.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401On the General Sum–Connectivity Co–Index of Graphs8998517310.22052/ijmc.2011.5173ENG. SUBeijing Institute of Technology, P. R. ChinaL. XUChangji University, P. R. ChinaJournal Article20140422In this paper, a new molecular-structure descriptor, the general sum–connectivity co–index is considered, which generalizes the first Zagreb co–index and the general sum– connectivity index of graph theory. We mainly explore the lower and upper bounds in terms of the order and size for this new invariant. Additionally, the Nordhaus–Gaddum–type result is also represented.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Distance Property of Fullerenes99107517410.22052/ijmc.2011.5174ENA. GRAOVACUniversity of Split, CroatiaO. ORIVia Casilina Rome, ItalyM. FAGHANIUniversity of Kashan, I. R. IranA. R.ASHRAFIUniversity of Kashan, I. R. IranJournal Article20140422Fullerenes are closed−cage carbon molecules formed by 12 pentagonal and n/2 – 10 hexagonal faces, where n is the number of carbon atoms. Patrick Fowler in his lecture in MCC 2009 asked about the Wiener index of fullerenes in general. In this paper we respond partially to this question for an infinite class of fullerenes with exactly 10n carbon atoms. Our method is general and can be applied to fullerene graphs with centrosymmetric adjacency matrix.University of KashanIranian Journal of Mathematical Chemistry2228-64892Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday)20110401Computing Some Topological Indices of Tensor Product of Graphs109118517510.22052/ijmc.2011.5175ENZ. YARAHMADIKhorramabad Branch, Islamic Azad University, I. R. IranJournal Article20140422A topological index of a molecular graph G is a numeric quantity related to G which is invariant under symmetry properties of G. In this paper we obtain the Randić, geometricarithmetic, first and second Zagreb indices , first and second Zagreb coindices of tensor product of two graphs and then the Harary, Schultz and modified Schultz indices of tensor product of a graph G with complete graph of order n are obtained.