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

Milica Milivojević Danas () and Ljiljana Pavlović ()
Additional contact information
Milica Milivojević Danas: University of Kragujevac
Ljiljana Pavlović: University of Kragujevac

Annals of Operations Research, 2022, vol. 316, issue 2, No 23, 1257-1266

Abstract: 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.

Keywords: Extremal graphs; Geometric–arithmetic index; Linear programming; 05C35; 90C35; 90C27 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-022-04778-1 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:annopr:v:316:y:2022:i:2:d:10.1007_s10479-022-04778-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-022-04778-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().