<?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>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On Discriminativity of Vertex-degree-based Indices</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>95</FirstPage>
			<LastPage>101</LastPage>
			<ELocationID EIdType="pii">5224</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5224</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>I.</FirstName>
					<LastName>GUTMAN</LastName>
<Affiliation>University of Kragujevac, Kragujevac, Serbia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by using some identities, well known in the theory of benzenoid hydrocarbons.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Zagreb index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vertex-degree-based indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Benzenoid graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Catacondensed benzenoid graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5224_cc384c68ad503482fb24e6d1e3b512ae.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Computational and Electrochemical Studies on the Redox Reaction of 2-(2,3-Dihydroxy Phenyl)-1,3- Dithiane in Aqueous Solution</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>103</FirstPage>
			<LastPage>112</LastPage>
			<ELocationID EIdType="pii">5227</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5227</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>MAZLOUM-ARDAKANI</LastName>
<Affiliation>Yazd University, I.R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>H.</FirstName>
					<LastName>BEITOLLAHI</LastName>
<Affiliation>Yazd University, I.R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>H.</FirstName>
					<LastName>FARROKHPOUR</LastName>
<Affiliation>Isfahan University of Technology, Iran</Affiliation>

</Author>
<Author>
					<FirstName>A. R.</FirstName>
					<LastName>KHOSHROO</LastName>
<Affiliation>Isfahan University of Technology, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>Electrode potential of 2-(2,3-dihydroxy phenyl)-1,3-dithiane (DPD) was investigated by means of cyclic voltammetry (CV) at various potential scan rates. The calculated value was compared with the experimental value obtained by cyclic voltammetry (CV). All experiments were done in aqueous phosphate buffer solutions at different pHs. The experimental redox potential of DPD was obtained to be 0.753 V versus SHE (Standard Hydrogen Electrode). DFT-B3LYP calculations using 6-311++G** basis set were performed to calculate the absolute redox potential of DPD. The calculated value of the redox potential relative to SHE is 0.766 V which is in good agreement with the experimental value (0.753).</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">redox reaction</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Density functional theory</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Computational chemistry</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cyclic Voltammetry</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5227_b91f4f4d36fa98a94ac5584af95594a0.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Tutte Polynomial of Benzenoid Chains</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>113</FirstPage>
			<LastPage>119</LastPage>
			<ELocationID EIdType="pii">5229</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5229</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>G.</FirstName>
					<LastName>FATH-TABAR</LastName>
<Affiliation>University of Kashan,
I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Z.</FirstName>
					<LastName>GHOLAM-REZAEI</LastName>
<Affiliation>University of Kashan,
 I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>A. R.</FirstName>
					<LastName>ASHRAFI</LastName>
<Affiliation>University of Kashan,
 I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Benzenoid chain</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tutte polynomial</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5229_080acdcce72c06873a773c4311c2e464.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Computing Wiener and Hyper–Wiener Indices of Unitary Cayley Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>121</FirstPage>
			<LastPage>125</LastPage>
			<ELocationID EIdType="pii">5230</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5230</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>LOGHMAN</LastName>
<Affiliation>Payame Noor Universtiy, IRAN</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Unitary Cayley graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Wiener index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">hyper-Wiener index</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5230_28b9f8aa9f07db88404721af4a5b6c11.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Chromatic Polynomials of Some Nanostars</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>127</FirstPage>
			<LastPage>135</LastPage>
			<ELocationID EIdType="pii">5232</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5232</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>S.</FirstName>
					<LastName>ALIKHANI</LastName>
<Affiliation>Yazd University, Iran</Affiliation>

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

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Chromatic polynomial</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nanostar</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5232_067ee197a2aa979778923af77b40dd89.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Note on Multiple Zagreb Indices</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>137</FirstPage>
			<LastPage>143</LastPage>
			<ELocationID EIdType="pii">5233</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5233</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>GHORBANI</LastName>
<Affiliation>Shahid Rajaee Teacher Training
University, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>N.</FirstName>
					<LastName>AZIMI</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>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given graph and then we compute the first and second extremal graphs for them.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Zagreb indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">vertex degree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multiple Zagreb indices</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5233_26b58a41da329e0cbde0cbf956640a58.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On Multiplicative Zagreb Indices of Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>145</FirstPage>
			<LastPage>154</LastPage>
			<ELocationID EIdType="pii">5234</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5234</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>IRANMANESH</LastName>
<Affiliation>TarbiatModares University,
Iran</Affiliation>

</Author>
<Author>
					<FirstName>M. A.</FirstName>
					<LastName>HOSSEINZADEH</LastName>
<Affiliation>TarbiatModares University,
Iran</Affiliation>

</Author>
<Author>
					<FirstName>I.</FirstName>
					<LastName>GUTMAN</LastName>
<Affiliation>University of Kragujevac, Kragujevac, Serbia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2 G d v d v G uv E G  G    , where dG(v) is the degree of the vertex v. In this paper we compute these indices for link and splice of graphs. In continuation, with use these graph operations, we compute the first and the second multiplicative Zagreb indices for a class of dendrimers.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multiplicative Zagreb indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Splice</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Link</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Chain graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dendrimer</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5234_5d78d182fd5f5510588695863d22ac27.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Fourth Order and Fourth Sum Connectivity Indices of Tetrathiafulvalene Dendrimers</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>155</FirstPage>
			<LastPage>163</LastPage>
			<ELocationID EIdType="pii">5235</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5235</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>R.</FirstName>
					<LastName>HASNI</LastName>
<Affiliation>Universiti Malaysia
Terengganu, Terengganu, Malaysia</Affiliation>

</Author>
<Author>
					<FirstName>N. E.</FirstName>
					<LastName>ARIF</LastName>
<Affiliation>Universiti Sains Malaysia,
Malaysia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>The m-order connectivity index (G) m of a graph G is     1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i m d d d  G where 1 2 1 ... i i im d d d  runs over all paths of length m in G and i d denotes the degree of vertex i v . Also,        1 2 1 1 2 1 ... ... 1 ( ) i i im m v v v i i i ms d d d X G is its m-sum connectivity index. A dendrimer is an artificially manufactured or synthesized molecule built up from branched units called monomers. In this paper, the 4-order connectivity and 4-sum connectivity indices of tetrathiafulvalene dendrimers are computed.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">4-Order connectivity index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">4-Sum connectivity index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dendrimer</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph</Param>
			</Object>
		</ObjectList>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Wiener, Szeged and Vertex PI Indices of Regular Tessellations</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>165</FirstPage>
			<LastPage>183</LastPage>
			<ELocationID EIdType="pii">5236</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5236</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>P.</FirstName>
					<LastName>MANUEL</LastName>
<Affiliation>Kuwait University, Safat, Kuwait</Affiliation>

</Author>
<Author>
					<FirstName>I.</FirstName>
					<LastName>RAJASINGH</LastName>
<Affiliation>Department of Mathematics, Loyola College, Chennai 600 034, India</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>AROCKIARAJ</LastName>
<Affiliation>Loyola College, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate this method to all classes of regular tessellations. In addition, we obtain the vertex Szeged and vertex PI indices of regular tessellations.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Wiener index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Szeged index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">PI index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Embedding</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Congestion</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Regular plane tessellations</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5236_78289d91e9c4adcf4e97d6b3d4df6ae0.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Zero One Programming Model for RNA Structures with Arclength ≥ 4</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>185</FirstPage>
			<LastPage>193</LastPage>
			<ELocationID EIdType="pii">5237</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5237</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>G. H.</FirstName>
					<LastName>SHIRDEL</LastName>
<Affiliation>University of Qom, Iran</Affiliation>

</Author>
<Author>
					<FirstName>N.</FirstName>
					<LastName>KAHKESHANI</LastName>
<Affiliation>University of Qom, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, we consider RNA structures with arc-length 4 . First, we represent these structures as matrix models and zero-one linearprogramming problems. Then, we obtain an optimal solution for this problemusing an implicit enumeration method. The optimal solution corresponds toan RNA structure with the maximum number of hydrogen bonds.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">RNA structure</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Zero-one linear programming problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Additive algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5237_2adcefe38fbcd3dcd45908fbab1bf628.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>3</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Fourth-order Numerical Solution of a Fractional PDE with the Nonlinear Source Term in the Electroanalytical Chemistry</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>195</FirstPage>
			<LastPage>220</LastPage>
			<ELocationID EIdType="pii">5147</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2012.5147</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>ABBASZADE</LastName>
<Affiliation>University of Kashan, Kashan, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>MOHEBBI</LastName>
<Affiliation>University of Kashan, Kashan, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2012</Year>
					<Month>05</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>The aim of this paper is to study the high order difference scheme for the solution of a fractional partial differential equation (PDE) in the electroanalytical chemistry. The space fractional derivative is described in the Riemann-Liouville sense. In the proposed scheme we discretize the space derivative with a fourth-order compact scheme and use the Grunwald- Letnikov discretization of the Riemann-Liouville derivative to obtain a fully discrete implicit scheme and analyze the solvability, stability and convergence of proposed scheme using the Fourier method. The convergence order of method is O(t + n4). Numerical examples demonstrate the theoretical results and high accuracy of proposed scheme.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Electroanalytical chemistry</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Reaction-sub-diffusion</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Compact finite difference</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Fourier analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">solvability</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">unconditional stability</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Convergence</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_5147_8f1fa0193ca2b5d2fa0695827d8270e9.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
