@article {
author = {HUBER, A.},
title = {A Diffusion Equation with Exponential Nonlinearity Recant Developments},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {143-162},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5289},
abstract = {The purpose of this paper is to analyze in detail a special nonlinear partial differential equation (nPDE) of the second order which is important in physical, chemical and technical applications. The present nPDE describes nonlinear diffusion and is of interest in several parts of physics, chemistry and engineering problems alike. Since nature is not linear intrinsically the nonlinear case is therefore the general. We determine the classical Lie point symmetries including algebraic properties whereas similarity solutions are given as well as nonlinear transformations could derived. In addition, we discuss the nonclassical case which seems to be not solvable. Moreover we show how one can deduce approximate symmetries modeling the nonlinear part and we deduce new generalized symmetries of lower symmetry. The analysis allows one to deduce wider classes of solutions either of practical and theoretical usage in different domains of science and engineering.},
keywords = {Nonlinear partial differential equation(s) or (nPDE(s)),Evolution equations,Lie group analysis,Similarity reduction (SR),Approximate symmetries,Generalized symmetries,nonlinear diffusion},
url = {http://ijmc.kashanu.ac.ir/article_5289.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5289_2e007f25037d0d105f2b293110474ea8.pdf}
}
@article {
author = {MASOUM, S. and GHAHERI, S.},
title = {Feature Selection and Classification of Microarray Gene Expression Data of Ovarian Carcinoma Patients using Weighted Voting Support Vector Machine},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {163-175},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5290},
abstract = {We can reach by DNA microarray gene expression to such wealth of information with thousands of variables (genes). Analysis of this information can show genetic reasons of disease and tumor differences. In this study we try to reduce high-dimensional data by statistical method to select valuable genes with high impact as biomarkers and then classify ovarian tumor based on gene expression data of two patient groups. One group treated by standard therapies and survived, while another group didn’t be cure and die after some times. In the first step we used weighted voting algorithm (WVA) for selecting impressive genes to reduce dimension, therefore eliminate noisy data and make analysis easier and then partial least square – discriminante analysis (PLS-DA) and support vector machine (SVM) methods have been applied for classification of diminished data. Results show that classification by PLS-DA can distinguish two groups somewhat but SVM is more efficient and sufficient classification method.},
keywords = {Weighted voting algorithm,Support Vector Machine,Tumor classification,Ovarian Cancer,Gene Expression data},
url = {http://ijmc.kashanu.ac.ir/article_5290.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5290_429167f84c969ebf129c9a59185620b1.pdf}
}
@article {
author = {WU, Y. and WEI, F. and JIA, Z.},
title = {The Generalized Wiener Polarity Index of some Graph Operations},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {177-183},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5291},
abstract = {Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.},
keywords = {Wiener index,Cartesian product,tensor product},
url = {http://ijmc.kashanu.ac.ir/article_5291.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5291_e1096cccf72ca05e59729a62d14028f7.pdf}
}
@article {
author = {TAVAKOL, H. and MOHAMMADI, H. and ASLANZADEH, S.},
title = {DFT Study of Kinetic and Thermodynamic Parameters of Tautomerism in 4−acyl Pyrazolone},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {185-199},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5292},
abstract = {In the present work, DFT calculations are employed to obtain the optimized structures of 4- acyl pyrazolone tautomers (19 tautomers) using B3LYP/6-311++G** calculations. In addition, molecular parameters, IR frequencies and relative energies are extracted for all tautomers. The existence of aromatic ring, keto tautomer (versus enol tautomer), N-H bond (versus C-H bond) and C=N double bond (versus N=N double bond) are stabilizing factors in relative stabilities of tautomers. Calculation of vibrational frequencies showed that, in accordance with reported values, intramolecular hydrogen bond (existed in some tautomers) decreased the value of OH frequency. The solvent effects on relative stabilities of tautomers are calculated. The relative stabilities of all the tautomers in acetone, tetrahydrofurane and chloroform (in all solvents, except water) were relatively the same as those in the gas phase. In addition, a nearly good relationship is found between dipole moments of tautomers and their 7Gsolv in chloroform. This relation shows that by increasing the dipole moment, the absolute amount of 7Gsolv in chloroform increases.},
keywords = {Pyrazolone,DFT,Tautomer,Solvent effect},
url = {http://ijmc.kashanu.ac.ir/article_5292.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5292_c138510f74a2bbdb455cb2f330275055.pdf}
}
@article {
author = {SHOKRI, A. and SHOKRI, A. A.},
title = {Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {201-212},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5293},
abstract = {In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the numerical solution of stiff first order initial value problems.},
keywords = {Hybrid method,Initial value problem,Multistep methods,Off-step points},
url = {http://ijmc.kashanu.ac.ir/article_5293.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5293_8028166ae8e7d9a63e3a80b18208adb4.pdf}
}
@article {
author = {SHIRDEL, G. and REZAPOUR, H. and SAYADI, A.},
title = {The Hyper-Zagreb Index of Graph Operations},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {213-220},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5294},
abstract = {Let G be a simple connected graph. The first and second Zagreb indices have been introduced as vV(G) (v)2 M1(G) degG and M2(G) uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G) (degG(u) degG In this paper, the HyperZagreb index of the Cartesian product, composition, join and disjunction of graphs are computed.},
keywords = {Hyper-Zagreb index,Zagreb index,Graph operation},
url = {http://ijmc.kashanu.ac.ir/article_5294.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5294_fbb55de9f98dd512946bb421b81a8dfe.pdf}
}
@article {
author = {TAVAKOLI, M. and RAHBARNIA, F.},
title = {Applications of some Graph Operations in Computing some Invariants of Chemical Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {221-230},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5295},
abstract = {In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.},
keywords = {topological index,Graph operation,Distance-balanced graph,Chemical graph},
url = {http://ijmc.kashanu.ac.ir/article_5295.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5295_d0a3f8a01ff5a70b280c0ea4a94f90f3.pdf}
}
@article {
author = {REYHANI, M. and ALIKHANI, S. and IRANMANESH, M.},
title = {On the Roots of Hosoya Polynomial of a Graph},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {231-238},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5296},
abstract = {Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific graphs.},
keywords = {Hosoya polynomial,root,Path,Cycle},
url = {http://ijmc.kashanu.ac.ir/article_5296.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5296_410164e0c444ea9cc736e03dd626520e.pdf}
}
@article {
author = {RAMANE, H. and GANAGI, A. and WALIKAR, H.},
title = {Wiener Index of Graphs in Terms of Eccentricities},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {239-248},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5299},
abstract = {The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.},
keywords = {Wiener index,Distance,Eccentricity,radius,diameter,self-centered graph},
url = {http://ijmc.kashanu.ac.ir/article_5299.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5299_e4714d9416dc74cc8611ae33bf9e475e.pdf}
}
@article {
author = {POURFARAJ, L.},
title = {Reciprocal Degree Distance of Grassmann Graphs},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {249-255},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5300},
abstract = {Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.},
keywords = {Grassmann graph,Harary index,Vertex- transitive graphs},
url = {http://ijmc.kashanu.ac.ir/article_5300.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5300_292363a7d23f1a685a6e9673fa5fc53f.pdf}
}
@article {
author = {ALIZADEH, Y.},
title = {On the Higher Randić Index},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {257-263},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5301},
abstract = {Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih v v v over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher Randic index of a simple graph is presented . Also, the higher Randić index of coronene/circumcoronene is computed.},
keywords = {Randić index,Higher Randić index,Coronene /circumcoronene},
url = {http://ijmc.kashanu.ac.ir/article_5301.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5301_2937bfe5de90a364cc45426a78b04b0b.pdf}
}
@article {
author = {ROSTAMI, M. and SOHRABI-HAGHIGHAT, M. and GHORBANI, M.},
title = {On Second Atom-Bond Connectivity Index},
journal = {Iranian Journal of Mathematical Chemistry},
volume = {4},
number = {2},
pages = {265-270},
year = {2013},
publisher = {University of Kashan},
issn = {2228-6489},
eissn = {2008-9015},
doi = {10.22052/ijmc.2013.5302},
abstract = {The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.},
keywords = {Atom–bond connectivity index,topological index,Star–like graph},
url = {http://ijmc.kashanu.ac.ir/article_5302.html},
eprint = {http://ijmc.kashanu.ac.ir/article_5302_88b5b777af28eda3d055d50368c08a18.pdf}
}