Lower bounds on the entire Zagreb indices of trees

DOI10.1155/2020/8616725MaRDI QIDQ2188024zbMATH OpenOpenAlexFDO

Authors Liang Luo, N. Dehgardi, Asfand Fahad

Publication date 3 June 2020

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/8616725

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

Summary: For a (molecular) graph \(G\), the first and the second entire Zagreb indices are defined by the formulas \(M_1^\varepsilon\left( G\right)=\sum_{x \in V \left( G\right) \cup E \left( G\right)} d \left( x\right)^2\) and \(M_2^\varepsilon\left( G\right)= \sum_{x \text{ is either adjacent or incident to } y} d \left( x\right) d \left( y\right)\) in which \(d\left( x\right)\) represents the degree of a vertex or an edge \(x\). 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.

Recommendations

• scientific article; zbMATH DE number 7410904
• Zagreb indices of graphs
• On extremal modified Zagreb indices of trees
• On the maximum and minimum Zagreb indices of trees with a given number of vertices of maximum degree
• Some estimations of Zagreb indices

Cites work

• A note on hyper-Zagreb index of graph operations
• A unified approach to extremal multiplicative Zagreb indices for trees, unicyclic and bicyclic graphs
• An upper bound on the first Zagreb index in trees
• Bounds for Zagreb indices
• Entire Zagreb indices of graphs
• From the connectivity index to various Randić-type descriptors
• scientific article; zbMATH DE number 2121251 (Why is no real title available?)
• scientific article; zbMATH DE number 7410904 (Why is no real title available?)
• scientific article; zbMATH DE number 2239308 (Why is no real title available?)
• Hyper Zagreb indices and its coindices of graphs
• Multiplicative versions of first Zagreb index
• Multiplicative Zagreb indices of trees
• On reformulated Zagreb indices
• On the maximum ABC index of graphs without pendent vertices
• On the multiplicative Zagreb coindex of graphs
• On Zagreb indices and coindices
• Relations between the first Zagreb index and spectral moment of graphs
• Some relations and bounds for the general first Zagreb index
• The star sequence and the general first Zagreb index
• The Zagreb coindices of graph operations
• Trees, unicyclic, and bicyclic graphs extremal with respect to multiplicative sum Zagreb index

Cited in

(15)

• Lower bounds on the irregularity of trees and unicyclic graphs
• On investigations of graphs preserving the Wiener index upon vertex removal
• On face index of silicon carbides
• On the reduced second Zagreb index of trees
• scientific article; zbMATH DE number 6940810 (Why is no real title available?)
• On the Zagreb index of random m-oriented recursive trees
• On extremal modified Zagreb indices of trees
• Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number
• Lower bounds on the general first Zagreb index of graphs with low cyclomatic number
• Trees, unicyclic graphs and their geometric Sombor index: an extremal approach
• Neighborhood version of third Zagreb index of trees
• On minimal trees with respect to hyper-Zagreb indices
• The neighborhood version of the hyper Zagreb index of trees
• A note on the re-defined third Zagreb index of trees
• On the reduced and increased Sombor indices of trees with given order and maximum degree

This page was built for publication: Lower bounds on the entire Zagreb indices of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188024)