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

On the monotonicity of topological indices and the connectivity of a graph

Author

Listed:
  • Wu, Renfang
  • Chen, Hanlin
  • Deng, Hanyuan

Abstract

Let I(G) be a topological index of a graph. If I(G+e)I(G), respectively) for each edge e∉G, then I(G) decreases (or increases, respectively) with addition of edges. In this paper, we determine the extremal values of some monotonic topological indices in terms of the number of cut vertices, or the number of cut edges, or the vertex connectivity, or the edge connectivity of a graph, and characterize the corresponding extremal graphs among all graphs of order n.

Suggested Citation

  • Wu, Renfang & Chen, Hanlin & Deng, Hanyuan, 2017. "On the monotonicity of topological indices and the connectivity of a graph," Applied Mathematics and Computation, Elsevier, vol. 298(C), pages 188-200.
    • Handle: RePEc:eee:apmaco:v:298:y:2017:i:c:p:188-200
    DOI: 10.1016/j.amc.2016.11.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316306853
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.11.017?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, Hanlin & Wu, Renfang & Deng, Hanyuan, 2016. "The extremal values of some topological indices in bipartite graphs with a given matching number," Applied Mathematics and Computation, Elsevier, vol. 280(C), pages 103-109.
    Full references (including those not matched with items on IDEAS)

    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.

      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:298:y:2017:i:c:p:188-200. 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.