<?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>11</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Modified First Zagreb Connection Index of Trees of a Fixed Order and Number of Branching Vertices</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>213</FirstPage>
			<LastPage>226</LastPage>
			<ELocationID EIdType="pii">110827</ELocationID>
			
<ELocationID EIdType="doi">10.22052/ijmc.2020.240260.1514</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Sadia</FirstName>
					<LastName>Noureen</LastName>
<Affiliation>National University of Computer and Emerging Sciences, Lahore, Pakistan</Affiliation>

</Author>
<Author>
					<FirstName>Akhlaq Ahmad</FirstName>
					<LastName>Bhatti</LastName>
<Affiliation>National University of Computer and
Emerging Sciences, Lahore, Pakistan</Affiliation>

</Author>
<Author>
					<FirstName>Akbar</FirstName>
					<LastName>Ali</LastName>
<Affiliation>University of Hail, Hail, Saudi Arabia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2020</Year>
					<Month>08</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		<Abstract>The modified first Zagreb connection index $ZC_{1}^{*}$ for a graph $G$ is defined as $ZC_{1}^{*}(G)= \sum_{v\in V(G)}d_{v}\tau_{v}\,$, where $d_{v}$ is degree of the vertex $v$ and $\tau _{v}$ is the connection number of $v$ (that is, the number of vertices having distance 2 from $v$). By an $n$-vertex graph, we mean a graph of order $n$. A branching vertex of a graph is a vertex with degree greater than $2$. In this paper, the graphs with maximum and minimum $ZC_{1}^{*}$ values are characterized from the class of all $n$-vertex trees with a fixed number of branching vertices.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Chemical graph theory</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">topological index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Zagreb connection indices</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">extremal problem</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijmc.kashanu.ac.ir/article_110827_9963a63de0e8366746c57fc8870654ad.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
