Comparing Zagreb indices for connected graphs

DOI10.1016/j.dam.2010.02.013zbMath1230.05188OpenAlexW1980089456MaRDI QIDQ708341

Batmend Horoldagva, Sang-Gu Lee

Publication date: 11 October 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.013

zbMATH Keywords

connected graphpendant vertexZagreb indices

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Complete characterization of graphs for direct comparing Zagreb indices, On a novel eccentricity-based invariant of a graph, On the first geometric-arithmetic index of graphs, MAXIMUM ZAGREB INDICES IN THE CLASS OF k-APEX TREES, Unnamed Item

Uses Software

• AutoGraphiX

Cites Work

• Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Sharp bounds for the second Zagreb index of unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item