IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v316y2022i2d10.1007_s10479-022-04778-1.html
   My bibliography  Save this article

On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree

Author

Listed:
  • Milica Milivojević Danas

    (University of Kragujevac)

  • Ljiljana Pavlović

    (University of Kragujevac)

Abstract

The geometric–arithmetic index GA of a graph is defined as sum of weights of all edges of graph. The weight of one edge is quotient of the geometric and arithmetic mean of degrees of its end vertices. The predictive power of GA for physico-chemical properties is somewhat better than the predictive power of other connectivity indices. Let G(k, n) be the set of connected simple n-vertex graphs with minimum vertex degree k. In this paper we characterized graphs on which GA index attains minimum value, when the number of vertices of minimum degree k is $$n-1$$ n - 1 and $$n-2$$ n - 2 . We also gave a conjecture about the structure of the extremal graphs on which this index attains its minimum value and lower bound for this index where k is less or equal to $$q_0$$ q 0 , and $$q_0$$ q 0 is approximately 0.0874. For k greater or equal to $$q_0$$ q 0 and k or n are even, extremal graphs in this set for which GA index attains its minimum value, are regular graphs of degree k.

Suggested Citation

  • Milica Milivojević Danas & Ljiljana Pavlović, 2022. "On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree," Annals of Operations Research, Springer, vol. 316(2), pages 1257-1266, September.
    • Handle: RePEc:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-022-04778-1
    DOI: 10.1007/s10479-022-04778-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04778-1
    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/s10479-022-04778-1?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. Mahdi Sohrabi-Haghighat & Mohammadreza Rostami, 2017. "The minimum value of geometric-arithmetic index of graphs with minimum degree 2," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 218-232, July.
    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:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-022-04778-1. 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.