Graph Classes (Dis)satisfying the Zagreb Indices Inequality

Vesna Andova 1 Nathann Cohen 2 Riste Skrekovski 3
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : {Recently Hansen and Vukicevic proved that the inequality $M_1/n \leq M_2/m$, where $M_1$ and $M_2$ are the first and second Zagreb indices, holds for chemical graphs, and Vukicevic and Graovac proved that this also holds for trees. In both works is given a distinct counterexample for which this inequality is false in general. Here, we present some classes of graphs with prescribed degrees, that satisfy $M_1/n \leq M_2/m$: Namely every graph $G$ whose degrees of vertices are in the interval $[c; c + \sqrt c]$ for some integer $c$ satisies this inequality. In addition, we prove that for any $\Delta \geq 5$, there is an infinite family of graphs of maximum degree $\Delta$ such that the inequality is false. Moreover, an alternative and slightly shorter proof for trees is presented, as well\ as for unicyclic graphs.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00531290
Contributor : Nathann Cohen <>
Submitted on : Tuesday, November 2, 2010 - 12:28:11 PM
Last modification on : Friday, March 15, 2019 - 4:55:06 PM
Document(s) archivé(s) le : Friday, December 2, 2016 - 2:15:08 AM

File

01108.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00531290, version 1

Collections

Citation

Vesna Andova, Nathann Cohen, Riste Skrekovski. Graph Classes (Dis)satisfying the Zagreb Indices Inequality. MATCH Communications in Mathematical and in Computer Chemistry, 2011, 65 (3), pp.647-658. ⟨hal-00531290⟩

Share

Metrics

Record views

787

Files downloads

205