Please use this identifier to cite or link to this item:
                
    
    https://scidar.kg.ac.rs/handle/123456789/11185Full metadata record
| DC Field | Value | Language | 
|---|---|---|
| dc.rights.license | restrictedAccess | - | 
| dc.contributor.author | Gutman, Ivan | - | 
| dc.date.accessioned | 2021-04-20T17:42:30Z | - | 
| dc.date.available | 2021-04-20T17:42:30Z | - | 
| dc.date.issued | 2018 | - | 
| dc.identifier.issn | 0096-3003 | - | 
| dc.identifier.uri | https://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.rights | info:eu-repo/semantics/restrictedAccess | - | 
| dc.source | Applied Mathematics and Computation | - | 
| dc.title | Stepwise irregular graphs | - | 
| dc.type | article | - | 
| dc.identifier.doi | 10.1016/j.amc.2017.12.045 | - | 
| dc.identifier.scopus | 2-s2.0-85040132710 | - | 
| Appears in Collections: | Faculty of Science, Kragujevac | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF |  View/Open | 
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.

 
            