Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees

DOI10.1016/j.dam.2008.10.007zbMath1272.05210OpenAlexW2010329587MaRDI QIDQ1028145

Ting Chen, Lingli Sun

Publication date: 30 June 2009

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

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

zbMATH Keywords

extremal graphsZagreb indicesmolecular structure descriptor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)

Related Items (7)

On the first geometric-arithmetic index of graphs ⋮ Relationship between the eccentric connectivity index and Zagreb indices ⋮ On the Zagreb index inequality of graphs with prescribed vertex degrees ⋮ Comparing Zagreb indices for connected graphs ⋮ On difference of Zagreb indices ⋮ On the Zagreb indices equality ⋮ Unnamed Item

Uses Software

• AutoGraphiX

Cites Work

• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees