<?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 Isfahan</PublisherName>
				<JournalTitle>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>14</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Minimal graphs with respect to the multiplicative version of some vertex-degree-based topological indices</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>157</FirstPage>
			<LastPage>172</LastPage>
			<ELocationID EIdType="pii">28369</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2024.139624.2119</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mehdi</FirstName>
					<LastName>Eliasi</LastName>
<Affiliation>Department of Mathematics , Khansar Faculty, University of Isfahan,  Isfahan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>10</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>As a real-valued function, a graphical parameter is defined on the class of finite simple graphs, and remains invariant under graph isomorphism. In mathematical chemistry, vertex-degree-based topological indices are the graph parameters of the general form of $p_{\phi}(G)=\sum_{uv\in E(G)}\phi(d(u),d(v))$, where $\phi$ represents a real-valued symmetric function, and $d(u)$ shows the degree of $u\in V(G)$. In this paper, it is proved that if $\phi$ has certain conditions, then the graph among those with $n$ vertices and $m$ edges, whose difference between the maximum and minimum degrees is at most $1$, has the minimal value of $p_{\phi}$. Moreover, it is demonstrated that some well-known topological indices are able to satisfy these certain conditions, and the given indices can be treated in a unified manner.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Graph parameter, topological index, General sum connectivity index, multiplicative Zagreb indices, Sombor index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Forgotten index</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_28369_69de69f3082f6df35d742356561470b1.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
