<?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>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Autobiographical Notes</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>231</FirstPage>
			<LastPage>257</LastPage>
			<ELocationID EIdType="pii">45087</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.64354.1248</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>N.</FirstName>
					<LastName>Trinajstić</LastName>
<Affiliation>The  Rugjer  Bošković  Institute  and  Croatian  Academy  of  Sciences  and  Arts,  Zagreb, Croatia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>10</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>I was born in Zagreb (Croatia) on October 26, 1936. My parents were Regina (née Pavić) (April17, 1916, Zagreb–March 9, 1992, Zagreb) and Cvjetko Trinajstić (September 9, 1913, Volosko–October 29, 1998, Richmond, Australia).</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Chemical graph theory</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">mathematical chemistry</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nanad Trinajstic</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_45087_fe31c60ddad05b1f35c8ccaeb75be409.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Graphs with Smallest Forgotten Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>259</FirstPage>
			<LastPage>273</LastPage>
			<ELocationID EIdType="pii">43258</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.43258</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>I.</FirstName>
					<LastName>Gutman</LastName>
<Affiliation>University of Kragujevac, Serbia</Affiliation>

</Author>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Ghalavand</LastName>
<Affiliation>University of Kashan</Affiliation>

</Author>
<Author>
					<FirstName>T.</FirstName>
					<LastName>Dehghan-Zadeh</LastName>
<Affiliation>University of Kashan</Affiliation>

</Author>
<Author>
					<FirstName>A. R.</FirstName>
					<LastName>Ashrafi</LastName>
<Affiliation>University of Kashan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>04</Month>
					<Day>22</Day>
				</PubDate>
			</History>
		<Abstract>The forgotten topological index of a molecular graph G is defined as F(G)=\sum_{v\in V(G)}d^{3}(v), where d(u) denotes the degree of vertex u in G. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number \gamma=1,2, the first through the fourth for \gamma=3, and the first and the second for \gamma=4,5 are determined. These results are compared with those obtained for the first Zagreb index.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Forgotten topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Unicyclic graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bicyclic graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tricyclic graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tetracyclic graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Pentacyclic graphs</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_43258_60932aad8f9b423afed9a875153fe9a1.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the First Variable Zagreb Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>275</FirstPage>
			<LastPage>283</LastPage>
			<ELocationID EIdType="pii">45113</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.71544.1262</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>K.</FirstName>
					<LastName>Moradian</LastName>
<Affiliation>Department of Statistics, Islamic Azad University</Affiliation>

</Author>
<Author>
					<FirstName>R.</FirstName>
					<LastName>Kazemi</LastName>
<Affiliation>Imam Khomeini international university</Affiliation>

</Author>
<Author>
					<FirstName>M. H.</FirstName>
					<LastName>Behzadi</LastName>
<Affiliation>Department of Statistics, Islamic Azad University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>12</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>‎The first variable Zagreb index of graph $G$ is defined as‎&lt;br /&gt; ‎\begin{eqnarray*}‎&lt;br /&gt; ‎M_{1,\lambda}(G)=\sum_{v\in V(G)}d(v)^{2\lambda}‎,&lt;br /&gt; ‎\end{eqnarray*}‎&lt;br /&gt; ‎where $\lambda$ is a real number and $d(v)$ is the degree of‎&lt;br /&gt; ‎vertex $v$‎.&lt;br /&gt; ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (recursive trees‎,&lt;br /&gt; ‎plane-oriented recursive trees and binary increasing trees) are‎&lt;br /&gt; ‎given‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">First variable Zagreb index‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Random increasing‎ ‎trees‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Distribution function‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Expected value</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_45113_752ad28b4b442dc6a1f6961c8509c82a.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Computing the Additive Degree-Kirchhoff Index with the Laplacian Matrix</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>285</FirstPage>
			<LastPage>290</LastPage>
			<ELocationID EIdType="pii">48532</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.64656.1249</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>J.</FirstName>
					<LastName>Palacios</LastName>
<Affiliation>The University of New Mexico, Albuquerque, NM 87131, USA</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>11</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Degree-Kirchhoff index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Laplacian matrix</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_48532_4ea24f618de4aee3f2e5feaf2ad0c8ca.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Spectra of Reduced Distance Matrix of the Generalized Bethe Trees</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>291</FirstPage>
			<LastPage>298</LastPage>
			<ELocationID EIdType="pii">48533</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.30051.1116</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Heydari</LastName>
<Affiliation>Arak University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2015</Year>
					<Month>06</Month>
					<Day>08</Day>
				</PubDate>
			</History>
		<Abstract>Let G be a simple connected graph and {v_1,v_2,..., v_k} 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 v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Reduced distance matrix</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized Bethe Tree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">spectrum</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_48533_625a9813ec4456891441f9eb3d1369f5.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Second Order First Zagreb Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>299</FirstPage>
			<LastPage>311</LastPage>
			<ELocationID EIdType="pii">49784</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.83138.1284</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>B</FirstName>
					<LastName>Basavanagoud</LastName>
<Affiliation>KARNATAK UNIVERSITY DHARWAD</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Patil</LastName>
<Affiliation>Karnatak University</Affiliation>

</Author>
<Author>
					<FirstName>H. Y.</FirstName>
					<LastName>Deng</LastName>
<Affiliation>Key Laboratoryof High Performance Computing and Stochastic Information Processing, College  of  Mathematics  and  Computer  Science,  Hunan  Normal  University,  Changsha, Hunan,  410081, P. R. China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2017</Year>
					<Month>04</Month>
					<Day>24</Day>
				</PubDate>
			</History>
		<Abstract>Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zagreb index, is better than models corresponding to the first Zagreb index and F-index. Further, we compute the second order first Zagreb index of line graphs of subdivision graphs of 2D-lattice, nanotube and nanotorus of TUC4C8[p; q], tadpole graphs, wheel graphs and ladder graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">line graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">subdivision graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nanostructure</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">tadpole graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_49784_8354f7dae388f810624e8396d0fc4b3a.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Anti-forcing Number of Some Specific Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>313</FirstPage>
			<LastPage>325</LastPage>
			<ELocationID EIdType="pii">49785</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.60978.1235</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Alikhani</LastName>
<Affiliation>Yazd University, Yazd, Iran</Affiliation>

</Author>
<Author>
					<FirstName>N.</FirstName>
					<LastName>Soltani</LastName>
<Affiliation>Yazd University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>09</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul&#039;e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specific graphs that are of importance in chemistry and study &lt;br /&gt; their anti-forcing numbers.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Anti-forcing number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Anti-forcing set</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Corona product</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_49785_5762b32f4d73311e1b30d195fe19f9ba.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Kashan</PublisherName>
				<JournalTitle>Iranian Journal of Mathematical Chemistry</JournalTitle>
				<Issn>2228-6489</Issn>
				<Volume>8</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Forgotten Topological Index</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>327</FirstPage>
			<LastPage>338</LastPage>
			<ELocationID EIdType="pii">43481</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2017.43481</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Khaksari</LastName>
<Affiliation>Department of Mathematics, Payame Noor University, Tehran, 19395 &amp;ndash; 3697, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Ghorbani</LastName>
<Affiliation>Department of mathematics, Shahid Rajaee Teacher Training University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>08</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Zagreb indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">forgotten index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph products</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_43481_e5cf8939aefd37aece3fc2f3f7bd8375.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
