A formula with its applications on the difference of Zagreb indices of graphs

DOI10.1007/s10910-019-01025-0zbMath1416.92193OpenAlexW2937998703MaRDI QIDQ2000928

Fang Gao, Kexiang Xu, Kinkar Chandra Das, Nenad Trinajstić

Publication date: 1 July 2019

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-019-01025-0

zbMATH Keywords

inverse problemchemical treedifference of Zagreb indices

Mathematics Subject Classification ID

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

Related Items

On the maximal general ABC index of graphs with given maximum degree ⋮ Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices ⋮ Lower bounds on the general first Zagreb index of graphs with low cyclomatic number ⋮ Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices ⋮ Solving the Mostar index inverse problem ⋮ Unnamed Item ⋮ Sombor index of chemical graphs ⋮ The minimal augmented Zagreb index of \(k\)-apex trees for \(k\in\{1,2,3\}\) ⋮ On Sombor index of trees ⋮ On the extremal sombor index of trees with a given diameter ⋮ On the maximum sigma index of \(k\)-cyclic graphs ⋮ Total i̇rregulari̇ty of fractal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete characterization of graphs for direct comparing Zagreb indices
• On difference of Zagreb indices
• On the sum of squares of degrees and products of adjacent degrees
• On graphs with largest possible game domination number
• A forgotten topological index
• Inverse problem for Zagreb indices
• The Zagreb indices of graphs with a given clique number
• All but 49 numbers are Wiener indices of trees