<?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>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>06</Month>
					<Day>11</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Max-min degree index of a graph and it’s mathematical relation with other topological indices</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14969</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30390.2450</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Shibsankar</FirstName>
					<LastName>Das</LastName>
<Affiliation>Department of Mathematics, Institute of Science, Banaras Hindu University,
Varanasi-221005, Uttar Pradesh, India</Affiliation>
<Identifier Source="ORCID">0000-0003-0082-6673</Identifier>

</Author>
<Author>
					<FirstName>Biswaranjan</FirstName>
					<LastName>Khanra</LastName>
<Affiliation>Department of Mathematics, Institute of Science, Banaras Hindu University,
Varanasi-221005, Uttar Pradesh, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>Among the defined $148$ discrete Adriatic indices, the max-min degree index is one. Vuki{\&#039;c}evi\&#039;c proposed some problems related to the upper and lower bounds on the max-min degree index. Here we determine the max-min degree index of some special graphs. We characterize the graphs extremal with respect to max-min degree index over connected graphs, trees and unicyclic graphs with a given number of vertices. Finally, we establish its mathematical relation with other topological indices.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">tree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Unicyclic graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bound</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14969_354608713e12a485ff9b05ff90dc9028.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
