ORIGINAL_ARTICLEA Diffusion Equation with Exponential Nonlinearity Recant DevelopmentsThe 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.http://ijmc.kashanu.ac.ir/article_5289_2e007f25037d0d105f2b293110474ea8.pdf2013-05-01T11:23:202018-05-24T11:23:2014316210.22052/ijmc.2013.5289Nonlinear partial differential equation(s) or (nPDE(s))Evolution equationsLie group analysisSimilarity reduction (SR)Approximate symmetriesGeneralized symmetriesnonlinear diffusionA.HUBERtrue1AustriaAustriaAustriaAUTHORORIGINAL_ARTICLEFeature Selection and Classification of Microarray Gene Expression Data of Ovarian Carcinoma Patients using Weighted Voting Support Vector MachineWe 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.http://ijmc.kashanu.ac.ir/article_5290_429167f84c969ebf129c9a59185620b1.pdf2013-05-01T11:23:202018-05-24T11:23:2016317510.22052/ijmc.2013.5290Weighted voting algorithmSupport Vector MachineTumor classificationOvarian cancerGene Expression dataS.MASOUMtrue1University of Kashan, I. R. IranUniversity of Kashan, I. R. IranUniversity of Kashan, I. R. IranAUTHORS.GHAHERItrue2University of Kashan, I. R. IranUniversity of Kashan, I. R. IranUniversity of Kashan, I. R. IranAUTHORORIGINAL_ARTICLEThe Generalized Wiener Polarity Index of some Graph OperationsLet 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.http://ijmc.kashanu.ac.ir/article_5291_e1096cccf72ca05e59729a62d14028f7.pdf2013-05-01T11:23:202018-05-24T11:23:2017718310.22052/ijmc.2013.5291Wiener indexCartesian producttensor productY.WUtrue1South China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaAUTHORF.WEItrue2South China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaAUTHORZ.JIAtrue3South China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaSouth China Agricultural University, P. R.
ChinaAUTHORORIGINAL_ARTICLEDFT Study of Kinetic and Thermodynamic Parameters of Tautomerism in 4−acyl PyrazoloneIn 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.http://ijmc.kashanu.ac.ir/article_5292_c138510f74a2bbdb455cb2f330275055.pdf2013-05-01T11:23:202018-05-24T11:23:2018519910.22052/ijmc.2013.5292PyrazoloneDFTTautomerSolvent effectH.TAVAKOLtrue1Isfahan University of Technology, IranIsfahan University of Technology, IranIsfahan University of Technology, IranAUTHORH.MOHAMMADItrue2Technical Vocational University, IranTechnical Vocational University, IranTechnical Vocational University, IranAUTHORS.ASLANZADEHtrue3Technical Vocational University, IranTechnical Vocational University, IranTechnical Vocational University, IranAUTHORORIGINAL_ARTICLEImplicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problemsIn 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 ynv 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.http://ijmc.kashanu.ac.ir/article_5293_8028166ae8e7d9a63e3a80b18208adb4.pdf2013-05-01T11:23:202018-05-24T11:23:2020121210.22052/ijmc.2013.5293Hybrid methodInitial value problemMultistep methodsOff-step pointsA.SHOKRItrue1University of Maragheh, IranUniversity of Maragheh, IranUniversity of Maragheh, IranAUTHORA. A.SHOKRItrue2Ahar Branch, Islamic Azad University, IranAhar Branch, Islamic Azad University, IranAhar Branch, Islamic Azad University, IranAUTHORORIGINAL_ARTICLEThe Hyper-Zagreb Index of Graph OperationsLet G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(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 HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian product, composition, join and disjunction of graphs are computed.http://ijmc.kashanu.ac.ir/article_5294_fbb55de9f98dd512946bb421b81a8dfe.pdf2013-05-01T11:23:202018-05-24T11:23:2021322010.22052/ijmc.2013.5294Hyper-Zagreb indexZagreb indexGraph operationG.SHIRDELtrue1University of Qom, IranUniversity of Qom, IranUniversity of Qom, IranAUTHORH.REZAPOURtrue2University of Qom,
IranUniversity of Qom,
IranUniversity of Qom,
IranAUTHORA.SAYADItrue3University of Tehran,
IranUniversity of Tehran,
IranUniversity of Tehran,
IranAUTHORORIGINAL_ARTICLEApplications of some Graph Operations in Computing some Invariants of Chemical GraphsIn 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.http://ijmc.kashanu.ac.ir/article_5295_d0a3f8a01ff5a70b280c0ea4a94f90f3.pdf2013-05-01T11:23:202018-05-24T11:23:2022123010.22052/ijmc.2013.5295Topological indexGraph operationDistance-balanced graphChemical graphM.TAVAKOLItrue1Ferdowsi University of Mashhad,
IranFerdowsi University of Mashhad,
IranFerdowsi University of Mashhad,
IranAUTHORF.RAHBARNIAtrue2Ferdowsi University of Mashhad, IranFerdowsi University of Mashhad, IranFerdowsi University of Mashhad, IranAUTHORORIGINAL_ARTICLEOn the Roots of Hosoya Polynomial of a GraphLet 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.http://ijmc.kashanu.ac.ir/article_5296_410164e0c444ea9cc736e03dd626520e.pdf2013-05-01T11:23:202018-05-24T11:23:2023123810.22052/ijmc.2013.5296Hosoya polynomialrootPathCycleM.REYHANItrue1Islamic Azad University, IranIslamic Azad University, IranIslamic Azad University, IranAUTHORS.ALIKHANItrue2Yazd University, Yazd, IranYazd University, Yazd, IranYazd University, Yazd, IranAUTHORM.IRANMANESHtrue3Yazd University, IranYazd University, IranYazd University, IranAUTHORORIGINAL_ARTICLEWiener Index of Graphs in Terms of EccentricitiesThe 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.http://ijmc.kashanu.ac.ir/article_5299_e4714d9416dc74cc8611ae33bf9e475e.pdf2013-05-01T11:23:202018-05-24T11:23:2023924810.22052/ijmc.2013.5299Wiener indexDistanceEccentricityradiusdiameterself-centered graphH.RAMANEtrue1Karnatak University, IndiaKarnatak University, IndiaKarnatak University, IndiaAUTHORA.GANAGItrue2Gogte Institute of Technology, IndiaGogte Institute of Technology, IndiaGogte Institute of Technology, IndiaAUTHORH.WALIKARtrue3Karnatak University, IndiaKarnatak University, IndiaKarnatak University, IndiaAUTHORORIGINAL_ARTICLEReciprocal Degree Distance of Grassmann GraphsRecently, 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.http://ijmc.kashanu.ac.ir/article_5300_292363a7d23f1a685a6e9673fa5fc53f.pdf2013-05-01T11:23:202018-05-24T11:23:2024925510.22052/ijmc.2013.5300Grassmann graphHarary indexVertex- transitive graphsL.POURFARAJtrue1Islamic Azad University, Central Tehran Branch,
IranIslamic Azad University, Central Tehran Branch,
IranIslamic Azad University, Central Tehran Branch,
IranAUTHORORIGINAL_ARTICLEOn the Higher Randić IndexLet 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.http://ijmc.kashanu.ac.ir/article_5301_2937bfe5de90a364cc45426a78b04b0b.pdf2013-05-01T11:23:202018-05-24T11:23:2025726310.22052/ijmc.2013.5301Randić indexHigher Randić indexCoronene /circumcoroneneY.ALIZADEHtrue1Hakim Sabzevari University, Sabzevar, IranHakim Sabzevari University, Sabzevar, IranHakim Sabzevari University, Sabzevar, IranAUTHORORIGINAL_ARTICLEOn Second Atom-Bond Connectivity IndexThe atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G)  uvE (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.http://ijmc.kashanu.ac.ir/article_5302_88b5b777af28eda3d055d50368c08a18.pdf2013-05-01T11:23:202018-05-24T11:23:2026527010.22052/ijmc.2013.5302Atom–bond connectivity indexTopological indexStar–like graphM.ROSTAMItrue1Mahallat Branch, Islamic Azad University,
IranMahallat Branch, Islamic Azad University,
IranMahallat Branch, Islamic Azad University,
IranAUTHORM.SOHRABI-HAGHIGHATtrue2Arak University, IranArak University, IranArak University, IranAUTHORM.GHORBANItrue3Shahid Rajaee Teacher Training
University, I. R. IranShahid Rajaee Teacher Training
University, I. R. IranShahid Rajaee Teacher Training
University, I. R. IranAUTHOR