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

Some extremal properties of the multiplicatively weighted Harary index of a graph

Author

Listed:
  • Shuchao Li

    (Central China Normal University)

  • Huihui Zhang

    (Central China Normal University)

Abstract

Let $$G=(V_G, E_G)$$ G = ( V G , E G ) be a simple connected graph. The multiplicatively weighted Harary index of $$G$$ G is defined as $$H_M(G)=\sum _{\{u,v\}\subseteq V_G}\delta _G(u)\delta _G(v)\frac{1}{d_G(u,v)},$$ H M ( G ) = ∑ { u , v } ⊆ V G δ G ( u ) δ G ( v ) 1 d G ( u , v ) , where $$\delta _G(u)$$ δ G ( u ) is the vertex degree of $$u$$ u and $$d_G(u,v)$$ d G ( u , v ) is the distance between $$u$$ u and $$v$$ v in $$G.$$ G . This novel invariant is in fact the modification of the Harary index in which the contributions of vertex pairs are weighted by the product of their degrees. Deng et al. (J Comb Optim 2014, doi: 10.1007/s10878-013-9698-5 ) determined the extremal values on $$H_M$$ H M of graphs among $$n$$ n -vertex trees (resp. unicyclic graphs). In this paper, as a continuance of it, the monotonicity of $$H_M(G)$$ H M ( G ) under some graph transformations were studied. Using these nice mathematical properties, the extremal graphs among $$n$$ n -vertex trees with given graphic parameters, such as pendants, matching number, domination number, diameter, vertex bipartition, et al. are characterized, respectively. Some sharp upper bounds on the multiplicatively weighted Harary index of trees with given parameters are determined.

Suggested Citation

  • Shuchao Li & Huihui Zhang, 2016. "Some extremal properties of the multiplicatively weighted Harary index of a graph," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 961-978, April.
  • Handle: RePEc:spr:jcomop:v:31:y:2016:i:3:d:10.1007_s10878-014-9802-5
    DOI: 10.1007/s10878-014-9802-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9802-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-014-9802-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. Bermudo, Sergio & Nápoles, Juan E. & Rada, Juan, 2020. "Extremal trees for the Randić index with given domination number," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    2. Sun, Xiaoling & Du, Jianwei, 2022. "On Sombor index of trees with fixed domination number," Applied Mathematics and Computation, Elsevier, vol. 421(C).

    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:31:y:2016:i:3:d:10.1007_s10878-014-9802-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.