<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Diffusion Equation with Exponential Nonlinearity Recant Developments</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>143</FirstPage>
			<LastPage>162</LastPage>
			<ELocationID EIdType="pii">5289</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5289</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>HUBER</LastName>
<Affiliation>Austria</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Nonlinear partial differential equation(s) or (nPDE(s))</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Evolution equations</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Lie group analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Similarity reduction (SR)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Approximate symmetries</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized symmetries</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nonlinear diffusion</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5289_2e007f25037d0d105f2b293110474ea8.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Feature Selection and Classification of Microarray Gene Expression Data of Ovarian Carcinoma Patients using Weighted Voting Support Vector Machine</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>163</FirstPage>
			<LastPage>175</LastPage>
			<ELocationID EIdType="pii">5290</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5290</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>S.</FirstName>
					<LastName>MASOUM</LastName>
<Affiliation>University of Kashan, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>GHAHERI</LastName>
<Affiliation>University of Kashan, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Weighted voting algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Support Vector Machine</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tumor classification</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Ovarian Cancer</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Gene Expression data</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5290_429167f84c969ebf129c9a59185620b1.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The Generalized Wiener Polarity Index of some Graph Operations</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>177</FirstPage>
			<LastPage>183</LastPage>
			<ELocationID EIdType="pii">5291</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5291</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Y.</FirstName>
					<LastName>WU</LastName>
<Affiliation>South China Agricultural University, P. R.
China</Affiliation>

</Author>
<Author>
					<FirstName>F.</FirstName>
					<LastName>WEI</LastName>
<Affiliation>South China Agricultural University, P. R.
China</Affiliation>

</Author>
<Author>
					<FirstName>Z.</FirstName>
					<LastName>JIA</LastName>
<Affiliation>South China Agricultural University, P. R.
China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Wiener index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cartesian product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">tensor product</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5291_e1096cccf72ca05e59729a62d14028f7.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>DFT Study of Kinetic and Thermodynamic Parameters of Tautomerism in 4−acyl Pyrazolone</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>185</FirstPage>
			<LastPage>199</LastPage>
			<ELocationID EIdType="pii">5292</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5292</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>H.</FirstName>
					<LastName>TAVAKOL</LastName>
<Affiliation>Isfahan University of Technology, Iran</Affiliation>

</Author>
<Author>
					<FirstName>H.</FirstName>
					<LastName>MOHAMMADI</LastName>
<Affiliation>Technical Vocational University, Iran</Affiliation>

</Author>
<Author>
					<FirstName>S. A.</FirstName>
					<LastName>ASLANZADEH</LastName>
<Affiliation>Technical Vocational University, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Pyrazolone</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">DFT</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tautomer</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Solvent effect</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5292_c138510f74a2bbdb455cb2f330275055.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>201</FirstPage>
			<LastPage>212</LastPage>
			<ELocationID EIdType="pii">5293</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5293</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>SHOKRI</LastName>
<Affiliation>University of Maragheh, Iran</Affiliation>

</Author>
<Author>
					<FirstName>A. A.</FirstName>
					<LastName>SHOKRI</LastName>
<Affiliation>Ahar Branch, Islamic Azad University, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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 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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Hybrid method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Initial value problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multistep methods</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Off-step points</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5293_8028166ae8e7d9a63e3a80b18208adb4.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The Hyper-Zagreb Index of Graph Operations</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>213</FirstPage>
			<LastPage>220</LastPage>
			<ELocationID EIdType="pii">5294</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5294</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>G. H.</FirstName>
					<LastName>SHIRDEL</LastName>
<Affiliation>University of Qom, Iran</Affiliation>

</Author>
<Author>
					<FirstName>H.</FirstName>
					<LastName>REZAPOUR</LastName>
<Affiliation>University of Qom, 
Iran</Affiliation>

</Author>
<Author>
					<FirstName>A. M.</FirstName>
					<LastName>SAYADI</LastName>
<Affiliation>University of Tehran, 
Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>Let 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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Hyper-Zagreb index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Zagreb index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph operation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5294_fbb55de9f98dd512946bb421b81a8dfe.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Applications of some Graph Operations in Computing some Invariants of Chemical Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>221</FirstPage>
			<LastPage>230</LastPage>
			<ELocationID EIdType="pii">5295</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5295</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>TAVAKOLI</LastName>
<Affiliation>Ferdowsi University of Mashhad, 
 Iran</Affiliation>

</Author>
<Author>
					<FirstName>F.</FirstName>
					<LastName>RAHBARNIA</LastName>
<Affiliation>Ferdowsi University of Mashhad, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph operation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Distance-balanced graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Chemical graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5295_d0a3f8a01ff5a70b280c0ea4a94f90f3.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Roots of Hosoya Polynomial of a Graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>231</FirstPage>
			<LastPage>238</LastPage>
			<ELocationID EIdType="pii">5296</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5296</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M. H.</FirstName>
					<LastName>REYHANI</LastName>
<Affiliation>Islamic Azad University, Iran</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>ALIKHANI</LastName>
<Affiliation>Yazd University, Yazd, Iran</Affiliation>

</Author>
<Author>
					<FirstName>M. A.</FirstName>
					<LastName>IRANMANESH</LastName>
<Affiliation>Yazd University, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Hosoya polynomial</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">root</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Path</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cycle</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5296_410164e0c444ea9cc736e03dd626520e.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Wiener Index of Graphs in Terms of Eccentricities</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>239</FirstPage>
			<LastPage>248</LastPage>
			<ELocationID EIdType="pii">5299</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5299</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>H. S.</FirstName>
					<LastName>RAMANE</LastName>
<Affiliation>Karnatak University, India</Affiliation>

</Author>
<Author>
					<FirstName>A. B.</FirstName>
					<LastName>GANAGI</LastName>
<Affiliation>Gogte Institute of Technology, India</Affiliation>

</Author>
<Author>
					<FirstName>H. B.</FirstName>
					<LastName>WALIKAR</LastName>
<Affiliation>Karnatak University, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Wiener index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Distance</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Eccentricity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">radius</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">diameter</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">self-centered graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5299_e4714d9416dc74cc8611ae33bf9e475e.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Reciprocal Degree Distance of Grassmann Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>249</FirstPage>
			<LastPage>255</LastPage>
			<ELocationID EIdType="pii">5300</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5300</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>L.</FirstName>
					<LastName>POURFARAJ</LastName>
<Affiliation>Islamic Azad University, Central Tehran Branch,
Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Grassmann graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Harary index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vertex- transitive graphs</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5300_292363a7d23f1a685a6e9673fa5fc53f.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Higher Randić Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>257</FirstPage>
			<LastPage>263</LastPage>
			<ELocationID EIdType="pii">5301</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5301</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Y.</FirstName>
					<LastName>ALIZADEH</LastName>
<Affiliation>Hakim Sabzevari University, Sabzevar, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Randić index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Higher Randić index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Coronene /circumcoronene</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5301_2937bfe5de90a364cc45426a78b04b0b.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2013</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On Second Atom-Bond Connectivity Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>265</FirstPage>
			<LastPage>270</LastPage>
			<ELocationID EIdType="pii">5302</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2013.5302</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>ROSTAMI</LastName>
<Affiliation>Mahallat Branch, Islamic Azad University,
Iran</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>SOHRABI-HAGHIGHAT</LastName>
<Affiliation>Arak University, Iran</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>GHORBANI</LastName>
<Affiliation>Shahid Rajaee Teacher Training
University, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>The 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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Atom–bond connectivity index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Star–like graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5302_88b5b777af28eda3d055d50368c08a18.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
