IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v325y2018icp234-238.html
   My bibliography  Save this article

Stepwise irregular graphs

Author

Listed:
  • Gutman, Ivan

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.

Suggested Citation

  • Gutman, Ivan, 2018. "Stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 234-238.
    • Handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:234-238
    DOI: 10.1016/j.amc.2017.12.045
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318300043
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.12.045?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Xiaodan & Hou, Yaoping & Lin, Fenggen, 2018. "Some new spectral bounds for graph irregularity," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 331-340.
    2. Gutman, Ivan & Furtula, Boris & Das, Kinkar Ch., 2016. "On some degree-and-distance-based graph invariants of trees," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 1-6.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dobrynin, Andrey A. & Sharafdini, Reza, 2020. "Stepwise transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    2. Buyantogtokh, Lkhagva & Azjargal, Enkhbayar & Horoldagva, Batmend & Dorjsembe, Shiikhar & Adiyanyam, Damchaa, 2021. "On the maximum size of stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    3. Wei Gao & Muhammad Aamir & Zahid Iqbal & Muhammad Ishaq & Adnan Aslam, 2019. "On Irregularity Measures of Some Dendrimers Structures," Mathematics, MDPI, vol. 7(3), pages 1-15, March.
    4. Réti, Tamás, 2019. "On some properties of graph irregularity indices with a particular regard to the σ-index," Applied Mathematics and Computation, Elsevier, vol. 344, pages 107-115.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gu, Tianqi & Kim, Inhi & Currie, Graham, 2019. "To be or not to be dockless: Empirical analysis of dockless bikeshare development in China," Transportation Research Part A: Policy and Practice, Elsevier, vol. 119(C), pages 122-147.
    2. Abdo, Hosam & Dimitrov, Darko & Gutman, Ivan, 2019. "Graph irregularity and its measures," Applied Mathematics and Computation, Elsevier, vol. 357(C), pages 317-324.
    3. Sakander Hayat & Amina Arif & Laiq Zada & Asad Khan & Yubin Zhong, 2022. "Mathematical Properties of a Novel Graph-Theoretic Irregularity Index with Potential Applicability in QSPR Modeling," Mathematics, MDPI, vol. 10(22), pages 1-24, November.
    4. Sandra Bestakova, 2019. "The Influence Of Short-Term Rental On Rental Housing Prices In Prague," Proceedings of Business and Management Conferences 8512235, International Institute of Social and Economic Sciences.
    5. Wei Gao & Muhammad Aamir & Zahid Iqbal & Muhammad Ishaq & Adnan Aslam, 2019. "On Irregularity Measures of Some Dendrimers Structures," Mathematics, MDPI, vol. 7(3), pages 1-15, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:234-238. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.