In graph theory, a stepwise irregular graph (or SI graph) is a graph in which the degrees of any two adjacent vertices differ by exactly one. This concept was introduced by Ivan Gutman in 2018 as a way to study graphs with minimal irregularity among those with non-zero edge imbalance.
In graph theory, a stepwise irregular graph (or SI graph) is a graph in which the degrees of any two adjacent vertices differ by exactly one. This concept was introduced by Ivan Gutman in 2018 as a way to study graphs with minimal irregularity among those with non-zero edge imbalance.
Source: Wikipedia "Stepwise irregular graph" · CC BY-SA 4.0
Share this article: X · Bluesky