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

Stepwise transmission irregular graphs

Author

Listed:
  • Dobrynin, Andrey A.
  • Sharafdini, Reza

Abstract

The distance d(u, v) between vertices u and v of a connected graph G is defined as the number of edges in a shortest path connecting them. The transmission of a vertex v of G is the sum of distances from v to all the other vertices of G. A graph is stepwise transmission irregular (STI) if the transmissions of any two of its adjacent vertices differ by exactly one. Some basic properties of STI graphs are established and infinite families are constructed.

Suggested Citation

  • Dobrynin, Andrey A. & Sharafdini, Reza, 2020. "Stepwise transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    • Handle: RePEc:eee:apmaco:v:371:y:2020:i:c:s0096300319309415
    DOI: 10.1016/j.amc.2019.124949
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319309415
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124949?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. Gutman, Ivan, 2018. "Stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 234-238.
    2. Dobrynin, Andrey A., 2019. "Infinite family of 2-connected transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 1-4.
    3. Alizadeh, Yaser & Klavžar, Sandi, 2018. "On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 113-118.
    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. Lin, Hongying & Zhou, Bo, 2021. "Which numbers are status differences?," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    2. Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    3. Bezhaev, Anatoly Yu. & Dobrynin, Andrey A., 2021. "On quartic transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    4. Al-Yakoob, Salem & Stevanović, Dragan, 2022. "On stepwise transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 413(C).

    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. Andrey A. Dobrynin & Andrei Yu Vesnin, 2019. "On the Wiener Complexity and the Wiener Index of Fullerene Graphs," Mathematics, MDPI, vol. 7(11), pages 1-17, November.
    2. Al-Yakoob, Salem & Stevanović, Dragan, 2020. "On transmission irregular starlike trees," Applied Mathematics and Computation, Elsevier, vol. 380(C).
    3. Bezhaev, Anatoly Yu. & Dobrynin, Andrey A., 2021. "On quartic transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    4. Anatoly Yu. Bezhaev & Andrey A. Dobrynin, 2022. "On Transmission Irregular Cubic Graphs of an Arbitrary Order," Mathematics, MDPI, vol. 10(15), pages 1-15, August.
    5. Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    6. 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.
    7. 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).
    8. Lin, Hongying & Zhou, Bo, 2021. "Which numbers are status differences?," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    9. Klavžar, Sandi & Azubha Jemilet, D. & Rajasingh, Indra & Manuel, Paul & Parthiban, N., 2018. "General Transmission Lemma and Wiener complexity of triangular grids," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 115-122.
    10. Martin Knor & Riste Škrekovski, 2020. "Wiener Complexity versus the Eccentric Complexity," Mathematics, MDPI, vol. 9(1), pages 1-9, December.
    11. Dobrynin, Andrey A., 2019. "Infinite family of 2-connected transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 1-4.
    12. 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.
    13. Hamid Darabi & Yaser Alizadeh & Sandi Klavžar & Kinkar Chandra Das, 2021. "On the relation between Wiener index and eccentricity of a graph," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 817-829, May.

    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:371:y:2020:i:c:s0096300319309415. 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.