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

Maximal Wiener index for graphs with prescribed number of blocks

Author

Listed:
  • Bessy, Stéphane
  • Dross, François
  • Hriňáková, Katarína
  • Knor, Martin
  • Škrekovski, Riste

Abstract

Wiener index, which is defined as the sum of distances between all unordered pairs of vertices, is one of the oldest and most popular molecular descriptors. It is known that among graphs on n vertices that have just one block, the n-cycle has the biggest Wiener index. In a previous work of the same authors, it was shown that among all graphs on n vertices which have p ≥ 2 blocks, the maximum Wiener index is attained by a graph composed of two cycles Ca and Cb joined by a path of length p−2 (possibly a and b are of size 2). In this paper we elaborate further this result and determine the sizes of a and b in the extremal graphs for each n and p. We distinguish six cases with crucial values being 5p−7 and 5p−8. Roughly speaking, if n bigger than 5p−7, then the extremal graphs is obtained for a=2. i.e. the graph is a path glued to a cycle. For values n=5p−8 and 5p−7, we have more than one extremal graph. And, when n<5p−8, the extremal graphs is again unique with a and b being equal or almost equal depending of the congruence of n−p modulo 4. We also showed unimodal property of a behaviour of Wiener index.

Suggested Citation

  • Bessy, Stéphane & Dross, François & Hriňáková, Katarína & Knor, Martin & Škrekovski, Riste, 2020. "Maximal Wiener index for graphs with prescribed number of blocks," Applied Mathematics and Computation, Elsevier, vol. 380(C).
    • Handle: RePEc:eee:apmaco:v:380:y:2020:i:c:s0096300320302435
    DOI: 10.1016/j.amc.2020.125274
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320302435
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125274?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. Stéphane Bessy & François Dross & Katarína Hriňáková & Martin Knor & Riste Škrekovski, 2020. "The structure of graphs with given number of blocks and the maximum Wiener index," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 170-184, January.
    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. Miklavič, Štefko & Šparl, Primož, 2021. "Distance-unbalancedness of graphs," Applied Mathematics and Computation, Elsevier, vol. 405(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.

      More about this item

      Statistics

      Access and download statistics

      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:380:y:2020:i:c:s0096300320302435. 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.