IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i1d10.1007_s10878-019-00458-2.html
   My bibliography  Save this article

On the extremal graphs with respect to the total reciprocal edge-eccentricity

Author

Listed:
  • Lifang Zhao

    (Lanzhou University)

  • Hongshuai Li

    (Zhongshan Overseas Chinese Secondary School)

  • Yuping Gao

    (Lanzhou University)

Abstract

The total reciprocal edge-eccentricity of a graph G is defined as $$\xi ^{ee}(G)=\sum _{u\in V_G}\frac{d_G(u)}{\varepsilon _G(u)}$$ξee(G)=∑u∈VGdG(u)εG(u), where $$d_G(u)$$dG(u) is the degree of u and $$\varepsilon _G(u)$$εG(u) is the eccentricity of u. In this paper, we first characterize the unique graph with the maximum total reciprocal edge-eccentricity among all graphs with a given number of cut vertices. Then we determine the k-connected bipartite graphs of order n with diameter d having the maximum total reciprocal edge-eccentricity. Finally, we identify the unique tree with the minimum total reciprocal edge-eccentricity among the n-vertex trees with given degree sequence.

Suggested Citation

  • Lifang Zhao & Hongshuai Li & Yuping Gao, 2020. "On the extremal graphs with respect to the total reciprocal edge-eccentricity," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 115-137, January.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00458-2
    DOI: 10.1007/s10878-019-00458-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00458-2
    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-019-00458-2?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. Ailin Hou & Shuchao Li & Lanzhen Song & Bing Wei, 2011. "Sharp bounds for Zagreb indices of maximal outerplanar graphs," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 252-269, August.
    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.
    1. Shuchao Li & Licheng Zhang & Minjie Zhang, 2019. "On the extremal cacti of given parameters with respect to the difference of zagreb indices," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 421-442, August.
    2. Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das, 2020. "On reduced second Zagreb index," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 776-791, April.
    3. John Estes & Bing Wei, 2014. "Sharp bounds of the Zagreb indices of k-trees," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 271-291, February.
    4. Shuchao Li & Huihui Zhang & Minjie Zhang, 2016. "Further results on the reciprocal degree distance of graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 648-668, 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:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00458-2. 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: 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.