<?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>05</Month>
					<Day>12</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Degree-weighted Sombor indices of trees and unicyclic graphs: An extremal approach</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">14945</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2025.30315.2413</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Nasrin</FirstName>
					<LastName>Dehgardi</LastName>
<Affiliation>Department of Mathematics and Computer Science, Sirjan University of Technology, Sirjan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Tomislav</FirstName>
					<LastName>Došlić</LastName>
<Affiliation>University of Zagreb, Faculty of Civil Engineering, Zagreb, Croatia</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>‎We consider two generalizations of the Sombor index, obtained by weighting the standard contribution $\sqrt{d_\Omega(\eta)^2+d_\Omega(\eta&#039;)^2}$ of an edge $\eta\eta&#039;$ of a graph $\Omega$ by the sum and by the product of degrees of its end-vertices, respectively. The first generalization has been considered under the name of the elliptic Sombor index, while the second one seems to be new. We consider trees and unicyclic graphs on a given number of vertices $n$ with a given maximum degree $\Delta $ and characterize the graphs minimizing both generalizations over those classes of graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Sombor index‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎degree-weighted Sombor index‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎elliptic Sombor‎ ‎index‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎trees‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎unicyclic graphs‎</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14945_b169f34b8997421eeb45d99b6950e961.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
