Title of article
On two-stepwise irregular graphs
Author/Authors
Das ، S. Department of Mathematics - Institute of Science - Banaras Hindu University , Mishra ، U. Department of Mathematics - Institute of Science - Banaras Hindu University , Rai ، S. Department of Mathematics - Institute of Science - Banaras Hindu University
From page
1049
To page
1057
Abstract
A graph G is called irregular if the degrees of all its vertices are not the same. A graph is said to be Stepwise Irregular (SI) if the di erence between the degrees of any two adjacent vertices is always 1. This paper deals with 2-Stepwise Irregular (2-SI) graphs in which the degrees of every pair of adjacent vertices di er 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.
Keywords
Irregular Graphs , Bipartite graph , Stepwise irregular graph , Albertson index
Journal title
Scientia Iranica(Transactions D: Computer Science and Electrical Engineering)
Journal title
Scientia Iranica(Transactions D: Computer Science and Electrical Engineering)
Record number
2746851
Link To Document