SOME RESULTS ON THE DIFFERENCE OF THE ZAGREB INDICES OF A GRAPH

DOI10.1017/S0004972715000386zbMath1321.05054MaRDI QIDQ2949797

Mingqiang An, Limning Xiong

Publication date: 2 October 2015

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

extremal graphsindependence numbermatching numbervertex connectivityZagreb indexvertex degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs ⋮ On the reduced second Zagreb index of graphs ⋮ On the extremal cacti of given parameters with respect to the difference of Zagreb indices ⋮ Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices ⋮ On reduced second Zagreb index ⋮ Upper bounds for the reduced second zagreb index of graphs

Cites Work

• Unnamed Item
• On difference of Zagreb indices
• A note on the irregularity of graphs
• An upper bound on the sum of squares of degrees in a graph
• Sums of powers of the degrees of a graph
• The Factorization of Linear Graphs

This page was built for publication: SOME RESULTS ON THE DIFFERENCE OF THE ZAGREB INDICES OF A GRAPH