<?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>8</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the Zagreb indices of graphs with given Roman domination number</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>141</FirstPage>
			<LastPage>152</LastPage>
			<ELocationID EIdType="pii">14324</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2021.27439.1263</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ayu Ameliatul Shahilah</FirstName>
					<LastName>Ahmad Jamri</LastName>
<Affiliation>MENGGABANG TELIPOT
KUALA NERUS</Affiliation>

</Author>
<Author>
					<FirstName>Roslan</FirstName>
					<LastName>Hasni</LastName>
<Affiliation>Universiti Malaysia Terengganu(UMT), Malaysia</Affiliation>

</Author>
<Author>
					<FirstName>Sharifah Kartini</FirstName>
					<LastName>Said Husain</LastName>
<Affiliation>Universiti Putra Malaysia(UPM)</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>09</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The two Zagreb indices $M_1=\sum_{v\in V(G)} d^2_G(v)$ and $M_2=\sum_{uv\in E(G)} d_G(u)d_G(v)$ are vertex degree based graph invariants that have been introduced in the 1970s and extensively studied ever since. {In this paper, we first give a lower bound on the first Zagreb index of trees with given Roman domination number and we characterize all extremal trees. Then we present upper bound for Zagreb indices of unicyclic and bicyclic graphs with given Roman domination number.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Zagreb index</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Roman domination number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">tree</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14324_9c5f1f9cdee97c3e03b866d32fa67a9e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
