<?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>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>30</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On two-stepwise irregular graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1049</FirstPage>
			<LastPage>1057</LastPage>
			<ELocationID EIdType="pii">23027</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.57725.5388</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>S.</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>U.</FirstName>
					<LastName>Mishra</LastName>
<Affiliation>Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi-221005, Uttar Pradesh, India</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Rai</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>2021</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>A graph $G$ is called irregular if the degrees of all its vertices are not the same. A graph is said to be \textit{Stepwise Irregular} (SI) if the difference of the degrees of any two adjacent vertices is always 1 (one). This paper deals with \textit{2-Stepwise Irregular} (2-SI) graphs in which the degrees of every pair of adjacent vertices differ by 2. Here we discuss some properties of 2-SI graphs and generalize them for $k$-SI graphs for which the imbalance of every edge is $k$. Besides, we also compute bounds of irregularity for the Albertson index in any 2-SI graph.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Irregular Graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bipartite graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Stepwise irregular graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Albertson index</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_23027_5c4981b81459ab6c1945c764de29d4d4.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
