<?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>Mathematics Interdisciplinary Research</JournalTitle>
				<Issn>2538-3639</Issn>
				<Volume>11</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Stability of 2-Domination Number of a Graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>113</FirstPage>
			<LastPage>124</LastPage>
			<ELocationID EIdType="pii">115523</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2025.257573.1540</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mazhar</FirstName>
					<LastName>Mehraban</LastName>
<Affiliation>Department of Mathematical Sciences, ‎Yazd University‎, ‎89195-741‎ ‎Yazd‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Saeid</FirstName>
					<LastName>Alikhani</LastName>
<Affiliation>Department of Mathematical Sciences, ‎Yazd University‎, ‎89195-741‎ ‎Yazd‎, ‎Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>09</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>‎This paper delves into the stability of the 2-domination number in simple undirected graphs‎. ‎The 2-domination number of a graph G‎, ‎$\gamma_2(G)$‎, ‎represents the minimum size of a vertex subset where every other vertex in the graph is adjacent to at least two members of the subset‎. ‎We define the $2$-domination stability‎, ‎$st_{\gamma_2}(G)$‎, ‎as the smallest number of vertices whose removal causes a change in $\gamma_2(G)$‎. ‎Our primary contributions include computing this parameter for specific graphs‎, ‎establishing various bounds for this stability‎, ‎and determining its behavior under certain graph operations combining two graphs‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Dominating set‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎2-Domination number‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Stability‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Operation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_115523_49a900eb52a696be092b9696b186f8c1.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
