Lower Bounds on the Entire Zagreb Indices of Trees

Liang Luo, Nasrin Dehgardi and Asfand Fahad

Discrete Dynamics in Nature and Society, 2020, vol. 2020, 1-8

Abstract:

For a (molecular) graph , the first and the second entire Zagreb indices are defined by the formulas and in which represents the degree of a vertex or an edge . In the current manuscript, we establish some lower bounds on the first and the second entire Zagreb indices and determine the extremal trees which achieve these bounds.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2020/8616725.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2020/8616725.xml (text/xml)

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:hin:jnddns:8616725

DOI: 10.1155/2020/8616725

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().