Upper bound for the geometric-arithmetic index of trees with given domination number

DOI10.1016/j.disc.2022.113172zbMath1504.05062OpenAlexW4297199276MaRDI QIDQ2092399

Sergio Bermudo

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113172

zbMATH Keywords

upper boundtreesdomination numbergeometric-arithmetic index

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (3)

Bounds for the geometric-arithmetic index of unicyclic graphs ⋮ On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves ⋮ The geometric-arithmetic index of trees with a given total domination number

Cites Work

• On extremal Zagreb indices of trees with given domination number
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• On Sombor index of trees with fixed domination number
• Extremal trees for the general Randić index with a given domination number
• On extremal multiplicative Zagreb indices of trees with given domination number
• Arithmetic-geometric index and its relations with geometric-arithmetic index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bound for the geometric-arithmetic index of trees with given domination number