The minimum value of geometric-arithmetic index of graphs with minimum degree 2

Mahdi Sohrabi-Haghighat () and Mohammadreza Rostami
Additional contact information
Mahdi Sohrabi-Haghighat: Arak University
Mohammadreza Rostami: Mahallat Institute of Higher Education

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 15, 218-232

Abstract: Abstract The geometric-arithmetic index was introduced in the chemical graph theory and it has shown to be applicable. The aim of this paper is to obtain the extremal graphs with respect to the geometric-arithmetic index among all graphs with minimum degree 2. Let G(2, n) be the set of connected simple graphs on n vertices with minimum degree 2. We use linear programming formulation and prove that the minimum value of the first geometric-arithmetic $$(GA_{1})$$ ( G A 1 ) index of G(2, n) is obtained by the following formula: $$\begin{aligned} GA_1^* = \left\{ \begin{array}{ll} n&{}\quad n \le 24, \\ \mathrm{{24}}\mathrm{{.79}}&{}\quad n = 25, \\ \frac{{4\left( {n - 2} \right) \sqrt{2\left( {n - 2} \right) } }}{n}&{}\quad n \ge 26. \\ \end{array} \right. \end{aligned}$$ G A 1 ∗ = n n ≤ 24 , 24 . 79 n = 25 , 4 n - 2 2 n - 2 n n ≥ 26 .

Keywords: Geometric-arithmetic index; Extremal graphs; Linear programming (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0062-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0062-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0062-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().