Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11185
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T17:42:30Z-
dc.date.available2021-04-20T17:42:30Z-
dc.date.issued2018-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11185-
dc.description.abstract© 2018 Elsevier Inc. 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.-
dc.rightsrestrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleStepwise irregular graphs-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2017.12.045-
dc.identifier.scopus2-s2.0-85040132710-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

120

Downloads(s)

6

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.