.png){kind=icon}
.png){kind=icon}
Return
Stepwise irregular graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2017.12.045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A graph is stepwise irregular (SI) if the degrees of any two of its adjacent vertices differ by exactly one. Among graphs with non-zero edge imbalance, SI graphs are least irregular. Some basic properties of SI graphs are established. (c) 2018 Elsevier Inc. All rights reserved.
Keywords:
Irregularity (of graph)
Albertson index
Degree (of vertex)
Stepwise irregular graph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W