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

Extremal cacti of given matching number with respect to the distance spectral radius

Author

Listed:
  • Zhang, Minjie
  • Li, Shuchao

Abstract

A cactus is a connected graph in which any two cycles have at most one common vertex. The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Recently, many researchers proposed the use of ρ(G) as a molecular structure descriptor of alkanes. In this paper, we characterize n-vertex cyclic cactus with given matching number m which minimizes the distance spectral radius. The resulting cactus also minimizes the Hosoya index, the Wiener index and the Randić index in the same class of graphs.

Suggested Citation

  • Zhang, Minjie & Li, Shuchao, 2016. "Extremal cacti of given matching number with respect to the distance spectral radius," Applied Mathematics and Computation, Elsevier, vol. 291(C), pages 89-97.
    • Handle: RePEc:eee:apmaco:v:291:y:2016:i:c:p:89-97
    DOI: 10.1016/j.amc.2016.06.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316304027
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.06.031?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.

    Citations

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


    Cited by:

    1. Shaowei Sun & Kinkar Chandra Das & Yilun Shang, 2021. "On Maximal Distance Energy," Mathematics, MDPI, vol. 9(4), pages 1-7, February.

    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:291:y:2016:i:c:p:89-97. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.