IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i3d10.1007_s10878-013-9645-5.html
   My bibliography  Save this article

Some results on the reciprocal sum-degree distance of graphs

Author

Listed:
  • Guifu Su

    (School of Mathematics, Beijing Institute of Technology
    University of Georgia)

  • Liming Xiong

    (School of Mathematics, Beijing Institute of Technology)

  • Xiaofeng Su

    (College of Arts and Science, Shanghai Maritime University)

  • Xianglian Chen

    (Changji University)

Abstract

In this contribution, we first investigate sharp bounds for the reciprocal sum-degree distance of graphs with a given matching number. The corresponding extremal graphs are characterized completely. Then we explore the $$k$$ k -decomposition for the reciprocal sum-degree distance. Finally, we establish formulas for the reciprocal sum-degree distance of join and the Cartesian product of graphs.

Suggested Citation

  • Guifu Su & Liming Xiong & Xiaofeng Su & Xianglian Chen, 2015. "Some results on the reciprocal sum-degree distance of graphs," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 435-446, October.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9645-5
    DOI: 10.1007/s10878-013-9645-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9645-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9645-5?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. Kexiang Xu & Haiqiong Liu & Kinkar Ch. Das & Sandi Klavžar, 2018. "Embeddings into almost self-centered graphs of given radius," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1388-1410, November.
    2. Kinkar Ch. Das & M. J. Nadjafi-Arani, 2017. "On maximum Wiener index of trees and graphs with given radius," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 574-587, August.

    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:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9645-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.