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

DOI10.1017/S0004972715000386zbMATH Open1321.05054MaRDI QIDQ2949797FDOQ2949797

Mingqiang An, Liming Xiong

Publication date: 2 October 2015

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

zbMATH Keywords

extremal graphsmatching numberindependence numbervertex degreeZagreb indexvertex connectivity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Factorization of Linear Graphs
• On difference of Zagreb indices
• An upper bound on the sum of squares of degrees in a graph
• A note on the irregularity of graphs
• Sums of powers of the degrees of a graph

Cited In (10)

• Upper bounds for the reduced second zagreb index of graphs
• Title not available (Why is that?)
• A formula with its applications on the difference of Zagreb indices of graphs
• Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
• The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
• On the extremal cacti of given parameters with respect to the difference of Zagreb indices
• On reduced second Zagreb index
• On the difference of Zagreb coindices of graph operations
• On the reduced second Zagreb index of graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949797)