A graph $G$ is called irregular if the degrees of all its vertices are not same. said to be \textit{Stepwise Irregular} (SI) difference any two adjacent always 1 (one). This paper deals with \textit{2-Stepwise (2-SI) graphs in which every pair differ by 2. Here we discuss some properties 2-SI and generalize them for $k$-SI imbalance edge $k$. Besides, also compute bounds irregularity Albertson ...

Our understanding of the program derivation process has evolved to the point where it can be described in terms of a clearly defined sequence of steps. In this paper, we will identify those steps and show how they may be used to derive programs from formal specifications. In describing the program derivation process we will focus on two things, its broad structure, and some detail for each of t...

computer model of the patellofemoral joint was developed and the effects on the anterior displacement of the tibial tuberosity were investigated. the input geometrical and verification data for the model were obtained form an experimental study on a cadaver knee, mounted in an instron machine. the computer program found the configuration of the patellofemoral joint which satified both the geome...