The Sharp Bounds Of Zagreb Indices On Connected Graphs

JOURNAL OF MATHEMATICAL INEQUALITIES(2021)

Cited 3|Views0
No score
Abstract
The analysis of a structure is based on its configuration. The common means available for this purpose is the use of graph products. The rooted product is specially revelent for trees. Chemical application of graph theory predicts different properties like physico-chemical properties, thermodynamics properties, chemical activity, biological activity, etc. Certain graph invariants known as topological indices are used for characterization of these properties. These indices have a promising role in chemical sciences and QSAR/QSPR studies. In this paper the lower and upper bounds of Zagreb indices, multiple Zagreb indices and F-index for rooted product of F-sum on connected graphs are determined.
More
Translated text
Key words
F-sum on graphs, rooted product of graphs, Zagreb indices, F-index, augmented Zagreb index
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined