Stepwise irregular graphs

Ivan Gutman

Applied Mathematics and Computation, 2018, vol. 325, issue C, 234-238

Abstract: 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.

Keywords: Irregularity (of graph); Albertson index; Degree (of vertex); Stepwise irregular graph (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318300043
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:325:y:2018:i:c:p:234-238

DOI: 10.1016/j.amc.2017.12.045

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().