An Upper Bound on the First Zagreb Index in Trees

DOI10.22052/ijmc.2017.42995zbMath1406.92780OpenAlexW2720702568MaRDI QIDQ4617695

Reza Rasi, Afshin Behmaram, Seyyed Mahmoud Sheikholeslami

Publication date: 7 February 2019

Full work available at URL: https://ijmc.kashanu.ac.ir/article_42995_aceaeaa2290cdaa2217a2205d4bda5af.pdf

zbMATH Keywords

treefirst Zagreb indexchemical treefirst Zagreb coindex

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number ⋮ Lower bounds on the entire Zagreb indices of trees ⋮ Modified hyper-Wiener index of trees ⋮ A note on the first Zagreb index and coindex of graphs

Cites Work

• The Zagreb coindices of graph operations
• An upper bound on the sum of squares of degrees in a graph
• Maximizing the sum of the squares of the degrees of a graph
• Vertex-weighted Wiener polynomials for composite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Upper Bound on the First Zagreb Index in Trees